DocumentCode
2385868
Title
A class of Sudan-decodable codes
Author
Nielsen, R. Refslund
Author_Institution
Dept. of Math., Tech. Univ. Denmark, Lyngby, Denmark
fYear
2000
fDate
2000
Firstpage
112
Abstract
In this paper Sudan´s algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed-Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons with Reed-Solomon and Hermitian codes are made
Keywords
Reed-Solomon codes; algebraic geometric codes; decoding; error correction codes; Hermitian codes; Reed-Solomon codes; Sudan-decodable codes; algebraic-geometry codes; decoding algorithms; generalized code construction; list decoding; Decoding; Error correction; Error correction codes; Galois fields; Geometry; Linear code; Mathematics; Polynomials; Reed-Solomon codes; Usability;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866402
Filename
866402
Link To Document