Skip to main content

Power Decoding of Reed–Solomon Codes Revisited

  • Conference paper

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

Abstract

Power decoding, or “decoding by virtual interleaving”, of Reed–Solomon codes is a method for unique decoding beyond half the minimum distance. We give a new variant of the Power decoding scheme, building upon the key equation of Gao. We show various interesting properties such as behavioural equivalence to the classical scheme using syndromes, as well as a new bound on the failure probability when the powering degree is 3.

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

Notes

  1. 1.

    Decoding may succeed in certain degenerate cases, see [3, Proposition 2.39]. Failure is certain when using the method of [5] since what it considers “solutions” are subtly different than here.

  2. 2.

    As in Theorem 3, failure is not certain but extremely unlikely for just a few errors beyond d∕2.

References

  1. Gao, S.: A new algorithm for decoding Reed-Solomon codes. In: Communications, Information and Network Security, no. 712 in S. Eng. and Comp. Sc., pp. 55–68. Springer (2003)

    Google Scholar 

  2. Nielsen, J.S.R.: Generalised multi-sequence shift-register synthesis using module minimisation. In: Proceedings of IEEE ISIT, Istanbul, 882–886 (2013)

    Google Scholar 

  3. Nielsen, J.S.R.: List decoding of algebraic codes. Ph.D. thesis, Technical University of Denmark (2013). Available at jsrn.dk

    Google Scholar 

  4. Roth, R.: Introduction to Coding Theory. Cambridge University Press, New York (2006)

    Book  MATH  Google Scholar 

  5. Schmidt, G., Sidorenko, V., Bossert, M.: Syndrome decoding of Reed-Solomon codes beyond half the minimum distance based on shift-register synthesis. IEEE Trans. Inf. Theory 56(10), 5245–5252 (2010)

    Article  MathSciNet  Google Scholar 

  6. Sidorenko, V., Bossert, M.: Fast skew-feedback shift-register synthesis. Designs, Codes Cryptogr. 70, 55–67 (2014)

    Google Scholar 

  7. Stein, W.A.: Sage Mathematics Software. http://www.sagemath.org (2014)

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

    Article  MathSciNet  MATH  Google Scholar 

  9. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, Cambridge (2012)

    Google Scholar 

  10. Zeh, A., Wachter, A., Bossert, M.: Unambiguous decoding of generalized Reed–Solomon codes beyond half the minimum distance. In: Proceedings of IZS, Zurich, 63–66 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Johan S. R. Nielsen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Nielsen, J.S.R. (2015). Power Decoding of Reed–Solomon Codes Revisited. 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_32

Download citation

Publish with us

Policies and ethics