Skip to main content
SpringerLink
Log in

A New Bound for Cyclic Codes Beating the Roos Bound

  • Conference paper
Algebraic Informatics (CAI 2013)

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

Included in the following conference series:

Abstract

We present a lower bound for the distance of a cyclic code, which is computed in polynomial time from the defining set of the code. Our bound beats other similar bounds, including the Roos bound, in the majority of computed cases.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bose, R.C., Ray Chaudhuri, D.K.: On a class of error correcting binary group codes. Information and Control 3, 68–79 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hartmann, C.R.P., Tzeng, K.K.: Generalizations of the BCH bound. Information and Control 20, 489–498 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  3. Roos, C.: A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound. Journal of Combinatorial Theory Ser. A 33, 229–232 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Roos, C.: A new lower bound for the minimum distance of a cyclic code. IEEE Trans. on Inf. Th. 29(3), 330–332 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  5. Betti, E., Sala, M.: A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set. IEEE Trans. on Inf. Th. 52(8), 3700–3706 (2006)

    Article  MathSciNet  Google Scholar 

  6. Schaub, T.: A Linear Complexity Approach to Cyclic Codes. PhD thesis, Swiss Federal Inst. of Tech. Zurich (1988)

    Google Scholar 

  7. van Lint, J.H., Wilson, R.M.: On the minimum distance of cyclic codes. IEEE Trans. on Inf. Th. 32(1), 23–40 (1986)

    Article  MATH  Google Scholar 

  8. Betti, E., Sala, M.: A theory for distance bounding cyclic codes. BCRI preprint 63 (2007), www.bcri.ucc.ie

  9. Ponchio, F., Sala, M.: A lower bound on the distance of cyclic codes. BCRI preprint 7 (2003), http://www.bcri.ucc.ie

  10. Piva, M.: Probabilità d’errore in decodifica con un nuovo bound. Master’s thesis (Laurea), University of Trento, Department of Mathematics (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Trento, Italy

    Matteo Piva & Massimiliano Sala

Authors
  1. Matteo Piva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Massimiliano Sala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ERISCS Research Group, Parc Scientifique de, Aix-Marseille University, Luminy, 13288, Marseille CEDEX 9, France

    Traian Muntean

  2. Department of Mathematics, Aristotle University of Thessaloniki, University Campus, 54124, Thessaloniki, Greece

    Dimitrios Poulakis

  3. ERISCS Research Group and IML Research Laboratory, Parc Scientifique de, Aix-Marseille University, Luminy, 13288, Marseille, France

    Robert Rolland

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Piva, M., Sala, M. (2013). A New Bound for Cyclic Codes Beating the Roos Bound. In: Muntean, T., Poulakis, D., Rolland, R. (eds) Algebraic Informatics. CAI 2013. Lecture Notes in Computer Science, vol 8080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40663-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40663-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40662-1

  • Online ISBN: 978-3-642-40663-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation