Abstract
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a dyadic analysis, using the Stickelberger congruences and the Gross-Koblitz formula, enables us to improve McEliece’s divisibility theorem by giving results on the multiplicity of the weights. Secondly, in connection with a Schmidt and White’s conjecture, we focus on binary irreducible cyclic codes of index two. We show, assuming the generalized Riemann hypothesis, that there are an infinite of such codes. Furthermore, we consider a subclass of this family of codes satisfying the quadratic residue conditions. The parameters of these codes are related to the class number of some imaginary quadratic number fields. We prove the non existence of such codes which provide us a very elementary proof, without assuming G.R.H, that any two-weight binary irreducible cyclic code c(m,v) of index two with v prime greater that three is semiprimitive.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ax, J.: Zeroes of polynomial over finite fields. Amer. J. Math. 86, 255–261 (1964)
Katz, N.: On a theorem of Ax. Amer. J. Math. 93, 485–499 (1971)
Koblitz, N.: p-adic Analysis: a Short Course on Recent Work. LMS LNS-46 (1980)
Langevin, P.: A new class of two weight codes. In: Finite Fields and Their Applications, Glasgow 1995, London Math. Soc. Lecture Note Ser, vol. 233, pp. 181–187 (1996)
Murata, L.: A problem analogous to Artin’s conjecture for primitive roots and its applications. Arch. Math. 57, 555–565 (1991)
Schmidt, B., White, C.: All two-weight irreducible cyclic codes? Finite Fields and Their Applications 8, 1–17 (2002)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier Science Publisher, Amsterdam (1991)
MacWilliams, J., Seery, J.: The weight distributions of some minimal cyclics codes. IEEE transactions on information theory IT-27, 6 (1981)
Wolfmann, J.: Are 2-weight projective cyclic codes irreducible? IEEE transactions on information theory 51(2), 733–737 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aubry, Y., Langevin, P. (2006). On the Weights of Binary Irreducible Cyclic Codes. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_5
Download citation
DOI: https://doi.org/10.1007/11779360_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35481-9
Online ISBN: 978-3-540-35482-6
eBook Packages: Computer ScienceComputer Science (R0)