Title :
Decoding algebraic-geometric codes up to the designed minimum distance
Author :
Feng, Gui-Liang ; Rao, T. N R
Author_Institution :
Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA
fDate :
1/1/1993 12:00:00 AM
Abstract :
A simple decoding procedure for algebraic-geometric codes C Ω(D,G) is presented. This decoding procedure is a generalization of Peterson´s decoding procedure for the BCH codes. It can be used to correct any [(d*-1)/2] or fewer errors with complexity O(n3), where d * is the designed minimum distance of the algebraic-geometric code and n is the codelength
Keywords :
computational complexity; decoding; error correction codes; algebraic-geometric codes; complexity; decoding procedure; error correction; minimum distance; Algebra; Algorithm design and analysis; Decoding; Error correction; Error correction codes; Geometry; Helium; Information theory; Iterative algorithms; Iterative decoding; Linear code;
Journal_Title :
Information Theory, IEEE Transactions on
