Abstract
In Langevin and Zanotti (1995), we introduced a new class of codes called balanced weight distribution (BWD)-codes, with the remarkable property that their weight distribution is balanced, i.e., there are the same number of codewords for each non-zero weight. The aim of this paper is to study the weights of such codes in the irreducible cyclic case. First we recall the fundamental property of BWD-codes, and we start this study from a deep link between weights and Gauss sums. We see that this particular situation is, roughly speaking, in opposition to those studied by McEliece (1974). We give the weights for the two-weight case, and we show that the weights ofanyN-weight BWD-code defined over Fqis completely determined by theNweights of a BWD-code of dimensionNdefined over the prime field Fp. The main result is on the asymptotic behavior of Gauss sums over Fp, by means of a nice technique introduced by Rodier (1993).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
