Skip to main content
SpringerLink
Log in

Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We derive the maximum decoding radius for interleaved Hermitian (IH) codes if a collaborative decoding scheme is used. A decoding algorithm that achieves this bound, which is based on a division decoding algorithm, is given. Based on the decoding radius for the interleaved codes, we derive a bound on the code rate below which virtual extension of non-interleaved Hermitian codes can improve the decoding capabilities.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bouw I.I., Kampf S.: Decoding Hermitian codes with a division algorithm. Adv. Math. Commun. (submitted).

  2. Brown A., Minder L., Shokrollahi A.: Improved decoding of interleaved AG codes. In: Smart, N. (ed) Cryptography and Coding. Lecture Notes in Computer Science, vol. 3796, pp. 37–46. Springer, Berlin (2005)

    Google Scholar 

  3. Cox D.A., Little J., O’Shea D.: Ideals, Varieties and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, New York (1992)

    Book  MATH  Google Scholar 

  4. Feng G.L., Tzeng K.K.: A generalized Euclidean algorithm for multisequence shift-register synthesis. IEEE Trans. Inf. Theory 35(3), 584–594 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Feng G.L., Tzeng K.K.: A generalization of the Berlekamp–Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes. IEEE Trans. Inf. Theory 37(5), 1274–1287 (1991)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Høholdt T., Pellikaan R.: On the decoding of algebraic-geometric codes. IEEE Trans. Inf. Theory 41(6), 1589–1614 (1995)

    Article  Google Scholar 

  8. Høholdt T., Refslund Nielsen R.: Decoding Hermitian codes with Sudan’s algorithm. In: Proceedings of AAECC-13. Lecture Notes in Computer Science, vol. 1719, pp. 260–270. Springer, Berlin (1999).

  9. Høholdt T., van Lint J.H., Pellikaan R.: Algebraic geometry codes. In: Pless, V.S., Huffman, W.C., Brualdi, R.A. (eds) Handbook of Coding Theory, vol. I, pp. 871–961. Elsevier, Amsterdam (1998)

    Google Scholar 

  10. Kampf S., Bossert M., Bezzateev S.: Some results on list decoding of interleaved Reed–Solomon codes with the extended Euclidean algorithm. In: Proc. Coding Theory Days in St. Petersburg. St. Petersburg, Russia, pp. 31–36 (2008).

  11. Kampf S., Bossert M., Bouw I.: Solving the key equation for Hermitian codes with a division algorithm. In: IEEE International Symposium on Information Theory 2011 (ISIT 2011). St. Petersburg, Russia, pp. 1008–1012 (2011).

  12. Porter S.C., Shen B.Z., Pellikaan R.: Decoding geometric Goppa codes using an extra place. IEEE Trans. Inf. Theory 38(6), 1663–1676 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Schmidt G., Sidorenko V.R., Bossert M.: Decoding Reed–Solomon codes beyond half the minimum distance using shift-register synthesis. In: IEEE International Symposium on Information Theory. Seattle, WA, USA, pp. 459–463 (2006).

  14. Schmidt G., Sidorenko V.R., Bossert M.: Enhancing the correcting radius of interleaved Reed–Solomon decoding using syndrome extension techniques. In: IEEE International Symposium on Information Theory. Nice, France, pp. 1341–1345 (2007).

  15. Schmidt G., Sidorenko V.R., Bossert M.: Collaborative decoding of interleaved Reed–Solomon codes and concatenated code designs. IEEE Trans. Inf. Theory 55(7), 2991–3012 (2009)

    Article  MathSciNet  Google Scholar 

  16. Schmidt G., Sidorenko V.R., 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 

  17. Shokrollahi A., Wasserman H.: List decoding of algebraic-geometric codes. IEEE Trans. Inf. Theory 45(2), 432–437 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  18. Stichtenoth H.: Algebraic Function Fields and Codes. Springer, Berlin (1993)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Communications Engineering, University of Ulm, Ulm, Germany

    Sabine Kampf

Authors
  1. Sabine Kampf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sabine Kampf.

Additional information

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding Theory and Applications”.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kampf, S. Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension. Des. Codes Cryptogr. 70, 9–25 (2014). https://doi.org/10.1007/s10623-012-9625-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-012-9625-2

Keywords

Mathematics Subject Classification

Search

Navigation