No label defined (Q4501026)

The author considers and studies the \(r\)-spectrum (as a generalization of the usual Hamming weight) and the \(r\)th, \(r\geq 1\), support weight spectrum of linear binary codes. An analog of the MacWilliams relation is obtained between the \(r\)th support weight spectrum of a linear binary code and the same kind of weight spectrum of its dual code. An asymptotic formula for the elements of the \(r\)-spectrum is derived for the binary BCH code of length \(n=2^m - 1\), correcting \(t\) errors, as \(n\to \infty\), with \(2t-1<2^{(m+1)/2}\). The method for calculating the 2-spectrum of a double-error-correcting BCH code of length \(n=2^m -1\), \(m\) odd, is calculated. For the entire collection see [Zbl 0918.00043].