DocumentCode
3069596
Title
A fast Generalized Minimum Distance decoder for Reed-Solomon codes based on the extended Euclidean algorithm
Author
Kampf, Sabine ; Bossert, Martin
Author_Institution
Inst. of Telecommun. & Appl. Inf. Theor., Univ. of Ulm, Ulm, Germany
fYear
2010
fDate
13-18 June 2010
Firstpage
1090
Lastpage
1094
Abstract
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).
Keywords
Reed-Solomon codes; communication complexity; decoding; polynomials; Reed-Solomon codes; basis polynomial set; extended Euclidean algorithm; fast generalized minimum distance decoder; Councils; Decoding; Discrete Fourier transforms; Equations; Information theory; Polynomials; Reed-Solomon codes; GMD; Reed-Solomon codes; Soft-Decision Decoding;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location
Austin, TX
Print_ISBN
978-1-4244-7890-3
Electronic_ISBN
978-1-4244-7891-0
Type
conf
DOI
10.1109/ISIT.2010.5513705
Filename
5513705
Link To Document