Title :
Linear dependence relations of nonrecurrent syndromes in decoding cyclic codes beyond their design distance
Author :
Armand, Marc A. ; Ong, S.H.
Author_Institution :
Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore
Abstract :
In 1994, Feng at. al. gave a procedure for decoding cyclic codes that is bounded by the minimum distance of a code. The significance of their work lies in the fact that conventional decoding procedures based on the classical key equation are design distance-bounded and so do not exploit the full error-correcting capability of a code. A crucial step in Feng´s decoding procedure is the computation of unknown syndromes using linear dependence relations. We present some results that may be used to carry out this important task.
Keywords :
cyclic codes; error correction codes; iterative decoding; Feng´s decoding procedure; code design distance; code length; code minimum distance; cyclic code decoding; error correcting cyclic code; ex-tended fundamental iterative algorithm; linear dependence relations; nonrecurrent syndromes; Algorithm design and analysis; Decoding; Equations; Fourier transforms; Iterative algorithms; Polynomials; Terminology;
Conference_Titel :
Communication Systems, 2002. ICCS 2002. The 8th International Conference on
Print_ISBN :
0-7803-7510-6
DOI :
10.1109/ICCS.2002.1182489
