Skip to main content
SpringerLink
Log in

Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy

(Extended Abstract)

  • Chapter
Mathematical Methods in Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5393))

  • 745 Accesses

Abstract

In 1990, Cooper [9, 10] suggested to use Gröbner basis [3, 4] computation in order to deduce error locator polynomials of cyclic codes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

References

  1. Augot, D., Bardet, M., Faugere, J.C.: Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases. In: Proc. IEEE Int. Symp. Information Theory 2003 (2003)

    Google Scholar 

  2. Augot, D., Bardet, M., Faugere, J.C.: On formulas for decoding binary cyclic codes. In: Proc. IEEE Int. Symp. Information Theory 2007 (2007)

    Google Scholar 

  3. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph. D. Thesis, Innsbruck (1965)

    Google Scholar 

  4. Buchberger, B.: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aeq. Math. 4, 374–383 (1970)

    Article  MATH  Google Scholar 

  5. Caboara, M.: The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem. J. AAECC 13 (2002)

    Google Scholar 

  6. Chen, X., Reed, I.S., Helleseth, T., Truong, K.: Use of Gröbner Bases to Decode Binary Cyclic Codes up to the True Minimum Distance. IEEE Trans. on Inf. Th. 40, 1654–1661 (1994)

    Article  MATH  Google Scholar 

  7. Chen, X., Reed, I.S., Helleseth, T., Truong, K.: General Principles for the Algebraic Decoding of Cyclic Codes. IEEE Trans. on Inf. Th. 40, 1661–1663 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chen, X., Reed, I.S., Helleseth, T., Truong, K.: Algebraic decoding of cyclic codes: A polynomial Ideal Point of View. Contemporary Mathematics 168, 15–22 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cooper III, A.B.: Direct solution of BCH decoding equations. In: Arikan, E. (ed.) Communication, Control and Singal Processing, pp. 281–286. Elsevier, Amsterdam (1990)

    Google Scholar 

  10. Cooper III, A.B.: Finding BCH error locator polynomials in one step. Electronic Letters 27, 2090–2091 (1991)

    Article  MATH  Google Scholar 

  11. Giorgetti, M., Sala, M.: A commutative algebra approach to linear codes, BCRI preprint, 58, UCC Cork, Ireland (2006), www.bcri.ucc.ie

  12. Loustaunau, P., York, E.V.: On the decoding of cyclic codes using Gröbner bases. J. AAECC 8, 469–483 (1997)

    Article  MATH  Google Scholar 

  13. Orsini, E., Sala, M.: Correcting errors and erasures via the syndrome variety. J. Pure Appl. Algebra 200, 191–226 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Orsini, E., Sala, M.: General error locator polynomials for binary cyclic codes with t ≤ 2 and n < 63. IEEE Trans. Inform. Theory 53, 1095–1107 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Orsini, E., Sala, M.: General error locator polynomials for binary cyclic codes with t ≤ 2 and n < 63, BCRI preprint (2005), http://www.bcri.ucc.ie

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Genoa, Italy

    Teo Mora

  2. Department of Mathematics, University of Milan, Italy

    Emmanuela Orsini

Authors
  1. Teo Mora
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuela Orsini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, 76128, Karlsruhe, Germany

    Jacques Calmet  & Jörn Müller-Quade  & 

  2. Institut für Algorithmen und Kognitive Systeme, Institut für Algorithmen und Kognitive Universität Karlsruhe, 76128, Karlsruhe, Germany

    Willi Geiselmann

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mora, T., Orsini, E. (2008). Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy. In: Calmet, J., Geiselmann, W., Müller-Quade, J. (eds) Mathematical Methods in Computer Science. Lecture Notes in Computer Science, vol 5393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89994-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89994-5_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89993-8

  • Online ISBN: 978-3-540-89994-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation