Burst-error correction for cyclic codes

The methods of burst-error correction for cyclic ( n, k ) codes based on the mathematical theory of linear finite-state machines (LFSM) are considered. The algorithm of sparse error burst correction of length no more than n - k/2, allowing to achieve k/2 times performance gain compared to with known methods is suggested. The algorithm of full error burst correction of arbitrary length tau and complexity O(ntimestau) based LFSM graphical models is suggested (tau = 1 divide n - 1). The possibility of parallel search of the errors of various types is shown.