Title :
The Euclidean algorithm for Generalized Minimum Distance decoding of Reed-Solomon codes
Author :
Kampf, Sabine ; Bossert, Martin
Author_Institution :
Inst. of Telecommun. & Appl. Inf. Theor., Univ. of Ulm, Ulm, Germany
fDate :
Aug. 30 2010-Sept. 3 2010
Abstract :
This paper presents a method to merge Generalized Minimum Distance decoding of Reed-Solomon codes with the extended Euclidean algorithm. By merge, we mean that the steps performed in Generalized Minimum Distance decoding are similar to those of the extended Euclidean algorithm. The resulting algorithm has a complexity of O(n2).
Keywords :
Reed-Solomon codes; Euclidean algorithm; Reed-Solomon codes; generalized minimum distance decoding; Complexity theory; Decoding; Iterative decoding; Mathematical model; Polynomials; Reed-Solomon codes;
Conference_Titel :
Information Theory Workshop (ITW), 2010 IEEE
Conference_Location :
Dublin
Print_ISBN :
978-1-4244-8262-7
Electronic_ISBN :
978-1-4244-8263-4
DOI :
10.1109/CIG.2010.5592677
