The Next-to-Minimal Weights of Binary Projective Reed–Muller Codes
The Next-to-Minimal Weights of Binary Projective Reed–Muller Codes
Projective Reed-Muller codes were introduced by Lachaud in 1988 and their dimension and minimum distance were determined by Serre and Sorensen in 1991. In coding theory, one is also interested in the higher Hamming weights, to study the code performance. Yet, not many values of the higher Hamming weights are …