Decoding Folded Reed–Solomon Codes Using Hensel-Lifting

Beelen, Peter; Brander, Kristian

doi:10.1007/978-3-540-93806-4_26

Decoding Folded Reed–Solomon Codes Using Hensel-Lifting

Peter Beelen⁶ &
Kristian Brander⁶

Chapter
First Online: 01 January 2009

1965 Accesses
5 Citations

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.

This is a preview of subscription content, log in via an institution.

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 84.99; Price excludes VAT (USA)

Softcover Book: USD 109.99; Price excludes VAT (USA)

Hardcover Book: USD 109.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

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.
Article MathSciNet MATH Google 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.
Article MathSciNet MATH Google Scholar
V. Y. Krachkovsky, Reed–Solomon codes for correcting phased error bursts, IEEE Trans. on Inf. Th. 49 (2003), no. 11, 2975–2984.
Article MathSciNet Google 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.
Article MathSciNet MATH Google Scholar

Download references

Author information

Authors and Affiliations

DTU Mathematics, Technical University of Denmark, Matematiktorvet 303S, 2800, Kgs. Lyngby, Denmark
Peter Beelen & Kristian Brander

Authors

Peter Beelen
View author publications
You can also search for this author in PubMed Google Scholar
Kristian Brander
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Beelen .

Editor information

Editors and Affiliations

Boole Centre for Research in Informatics, University College Cork, Crosses Green 17 South Bank, Cork, Ireland
Massimiliano Sala
Faculty of Engineering Dept. Production Systems Engineering, Toyohashi University of Technology, 1-1 Hibarigaoka Toyohashi, Aichi, Tempaku-cho, 441-8580, Japan
Shojiro Sakata
Dipto. Matematica, Università Genova, Via Dodecaneso, 35, 16146, Genova, Italy
Teo Mora
Dipto. Matematica, Università Pisa, Largo Bruno Pontecorvo, 5, 56127, Pisa, Italy
Carlo Traverso
LIP6, University of Paris VI, 104 avenue du Président Kennedy, 75016, Paris, France
Ludovic Perret

Rights and permissions

Reprints and permissions

Copyright information

About this chapter

Cite this chapter

Beelen, P., Brander, K. (2009). Decoding Folded Reed–Solomon Codes Using Hensel-Lifting. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds) Gröbner Bases, Coding, and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_26

Download citation

DOI: https://doi.org/10.1007/978-3-540-93806-4_26
Published: 21 May 2009
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93805-7
Online ISBN: 978-3-540-93806-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)

Publish with us

Policies and ethics