Title :
Efficient generalized minimum distance decoding of algebraic geometric codes
Author_Institution :
Dept. of Electr. Eng., Linkoping Univ., Sweden
fDate :
27 Jun-1 Jul 1994
Abstract :
A decoding algorithm for the efficient generalized minimum distance (GMD) decoding of algebraic geometric codes is given. The required complexity of finding all relevant error-erasure-locating functions in GMD decoding is shown to be in the same order as that of hard decoding
Keywords :
algebraic geometric codes; decoding; algebraic geometric codes; complexity; decoding algorithm; error-erasure-locating functions; generalized minimum distance decoding; hard decoding; Block codes; Decoding; Equations; Iterative algorithms; Linear code; Pain; Vectors;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394824
