A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A class of Sudan-decodable codes
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
Preserved Fulltext
In this correspondence, 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.
doi:10.1109/isit.2000.866402
fatcat:zks2ap6wlnhcbnmbsfthfkvobe