On the Weights of Binary Irreducible Cyclic Codes

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 gre...

• Type: Conference
• Year: 2005
• Where: WCC
• Authors: Yves Aubry, Philippe Langevin
• Keywords: Cryptography, Generalized Riemann Hypothesis, Irreducible Cyclic Code, McEliece’s Divisibility Theorem, WCC 2005