Gröbner Bases, Coding, and Cryptography pp 389-394 | Cite as
Decoding Folded Reed–Solomon Codes Using Hensel-Lifting
Chapter
First Online:
Abstract
A standard problem in coding theory is to construct good codes together with an efficient decoder. This paper addresses the construction of a class of codes (folded RS codes) for which one can give an efficient and (in a certain sense) optimal decoder, by adapting a list decoding algorithm.
Keywords
Interpolation Polynomial Code Word Primitive Element Weighted Degree Good Code
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- P. Beelen and K. Brander, Decoding of folded codes using Hensel-lifting, Preprint, April 2007. Google Scholar
- E. Guerrini and A. Rimoldi, FGLM-like decoding: from Fitzpatrick’s approach to recent developments, this volume, 2009, pp. 197–218. Google Scholar
- V. Guruswami and A. Rudra, Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy, IEEE Trans. On Inf. Th. 54 (2008), no. 1, 135–150. MathSciNetMATHCrossRefGoogle Scholar
- V. Guruswami and M. Sudan, Improved decoding of Reed–Solomon and algebraic geometric codes, IEEE Trans. on Inf. Th. 45 (1999), no. 6, 1757–1767. MathSciNetMATHCrossRefGoogle Scholar
- V. Y. Krachkovsky, Reed–Solomon codes for correcting phased error bursts, IEEE Trans. on Inf. Th. 49 (2003), no. 11, 2975–2984. MathSciNetCrossRefGoogle Scholar
- F. Parvaresh and A. Vardy, Correcting errors beyond the Guruswami–Sudan radius in polynomial time, Proc. of IEEE FOCS 2005, IEEE Computer Society, Alamitos, 2005, pp. 285–294. Google Scholar
- R. M. Roth and G. Ruckenstein, Efficient decoding of Reed–Solomon codes beyond half the minimum distance, IEEE Trans. on Inf. Th. 46 (2000), no. 1, 246–257. MathSciNetMATHCrossRefGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2009