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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bose, R.C., Ray Chaudhuri, D.K.: On a class of error correcting binary group codes. Information and Control 3, 68–79 (1960)
Hartmann, C.R.P., Tzeng, K.K.: Generalizations of the BCH bound. Information and Control 20, 489–498 (1972)
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)
Roos, C.: A new lower bound for the minimum distance of a cyclic code. IEEE Trans. on Inf. Th. 29(3), 330–332 (1983)
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)
Schaub, T.: A Linear Complexity Approach to Cyclic Codes. PhD thesis, Swiss Federal Inst. of Tech. Zurich (1988)
van Lint, J.H., Wilson, R.M.: On the minimum distance of cyclic codes. IEEE Trans. on Inf. Th. 32(1), 23–40 (1986)
Betti, E., Sala, M.: A theory for distance bounding cyclic codes. BCRI preprint 63 (2007), www.bcri.ucc.ie
Ponchio, F., Sala, M.: A lower bound on the distance of cyclic codes. BCRI preprint 7 (2003), http://www.bcri.ucc.ie
Piva, M.: Probabilità d’errore in decodifica con un nuovo bound. Master’s thesis (Laurea), University of Trento, Department of Mathematics (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)