On the Weights of Binary Irreducible Cyclic Codes

  • Yves Aubry
  • Philippe Langevin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3969)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ax, J.: Zeroes of polynomial over finite fields. Amer. J. Math. 86, 255–261 (1964)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Katz, N.: On a theorem of Ax. Amer. J. Math. 93, 485–499 (1971)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Koblitz, N.: p-adic Analysis: a Short Course on Recent Work. LMS LNS-46 (1980)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Murata, L.: A problem analogous to Artin’s conjecture for primitive roots and its applications. Arch. Math. 57, 555–565 (1991)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Schmidt, B., White, C.: All two-weight irreducible cyclic codes? Finite Fields and Their Applications 8, 1–17 (2002)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier Science Publisher, Amsterdam (1991)MATHGoogle Scholar
  8. 8.
    MacWilliams, J., Seery, J.: The weight distributions of some minimal cyclics codes. IEEE transactions on information theory IT-27, 6 (1981)MathSciNetMATHGoogle Scholar
  9. 9.
    Wolfmann, J.: Are 2-weight projective cyclic codes irreducible? IEEE transactions on information theory 51(2), 733–737 (2005)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yves Aubry
    • 1
  • Philippe Langevin
    • 1
  1. 1.Laboratoire GRIMUniversité du Sud Toulon-VarLa GardeFrance

Personalised recommendations