On the Gröbner bases of some symmetric systems and their application to coding theory
Journal of Symbolic Computation
Hi-index | 754.84 |
Usually spectra (weight distributions) of primitive binary BCH codes are supposed to approximate binomial weight distributions well for a wide range of code rates and code lengths. It is shown that for any fixed code rate R<1 spectra of long (N→∞) primitive binary BCH codes cannot approximate the binomial distribution at all