Skip to main content

On the Error-Correcting Radius of Folded Reed–Solomon Code Designs

  • Conference paper

Part of the book series: CIM Series in Mathematical Sciences ((CIMSMS,volume 3))

Abstract

A general formula for the error-correcting radius of linear-algebraic multivariate interpolation decoding of folded Reed–Solomon (FRS) codes is derived. Based on this result, an improved construction of FRS codes is motivated, which can be obtained by puncturing Parvaresh–Vardy codes. The proposed codes allow decoding for all rates, remove the structural loss in decoding radius of the original FRS design and maximize the fraction of correctable errors.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Gemmell, P., Sudan, M.: Highly resilient correctors for polynomials. Inform. Process. Lett. 43(4), 169–174 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Guruswami, V., Rudra, A.: Explicit codes achieving list decoding capacity: error-correction with optimal redundancy. IEEE Trans. Inf. Theory 54(1), 135–150 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Guruswami, V., Sudan, M.: Improved decoding of Reed–Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45(6), 1757–1767 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Guruswami, V., Wang, C.: Explicit rank-metric codes list-decodable with optimal redundancy. CoRR abs/1311.7084 (2013)

    Google Scholar 

  5. Guruswami, V., Wang, C.: Linear-algebraic list decoding for variants of Reed–Solomon codes. IEEE Trans. Inf. Theory 59(6), 3257–3268 (2013)

    Article  MathSciNet  Google Scholar 

  6. Justesen, J., Høholdt, T.: A course in error-correcting codes. Eur. Math. Soc. Zürich (2004). doi:10.4171/001

    MATH  Google Scholar 

  7. Lang, S.: Algebra. Graduate Texts in Mathematics, vol. 211, 3rd edn. Springer, New York (2002)

    Google Scholar 

  8. Parvaresh, F., Vardy, A.: Correcting errors beyond the Guruswami–Sudan radius in polynomial time. In: Proc. 46th IEEE Symp.Found.Comp.Sci.Pittsburgh, pp. 285–294 (2005)

    Google Scholar 

  9. Sudan, M.: Decoding of Reed–Solomon codes beyond the error-correction bound. J. Complex. 13(1), 180–193 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Vadhan, S.: Pseudorandomness. Found. Trends Theor. Comput. Sci. 7, 1–336 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Welch, L., Berlekamp, E.: Error correction for algebraic block codes. US Patent 4,633,470 (1986)

    Google Scholar 

Download references

Acknowledgements

The author is supported by the German Ministry of Education and Research in the framework of the Alexander von Humboldt-Professorship and thanks G. Kramer, F. Kschi-schang, and V. Sidorenko as well as C. Senger, H. Bartz for their comments and discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joschi Brauchle .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Brauchle, J. (2015). On the Error-Correcting Radius of Folded Reed–Solomon Code Designs. In: Pinto, R., Rocha Malonek, P., Vettori, P. (eds) Coding Theory and Applications. CIM Series in Mathematical Sciences, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-319-17296-5_7

Download citation

Publish with us

Policies and ethics