Title :
Burst-error correction for cyclic codes
Author :
Semerenko, Vasyl P.
Abstract :
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.
Keywords :
cyclic codes; error correction codes; finite state machines; LFSM graphical models; burst-error correction code; cyclic codes; linear finite-state machines; mathematical theory; Decoding; Error correction; Error correction codes; Galois fields; Graphical models; Hardware; Interleaved codes; Optical distortion; Optical transmitters; Performance gain; complexity of algorithms; cyclic codes; error bursts; linear finite-state machines;
Conference_Titel :
EUROCON 2009, EUROCON '09. IEEE
Conference_Location :
St.-Petersburg
Print_ISBN :
978-1-4244-3860-0
Electronic_ISBN :
978-1-4244-3861-7
DOI :
10.1109/EURCON.2009.5167864
