On the weight distribution of binary linear codes (Corresp.)
- 1 January 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 25 (1) , 105-109
- https://doi.org/10.1109/tit.1979.1056001
Abstract
LetVbe a binary linear(n,k)-code defined by a check matrixHwith columnsh_{1}, \cdots ,h_{n}, and leth(x) = 1ifx \in {h_{1}, \cdots , h_{n}, andh(x) = 0ifx \in \neq {h_{1}, \cdots ,h_{n}}. A combinatorial argument relates the Walsh transform ofh(x)with the weight distributionA(i)of the codeVfor smalli(i< 7). This leads to another proof of the Plessith power moment identities fori < 7. This relation also provides a simple method for computing the weight distributionA(i)for smalli. The implementation of this method requires at most(n-k+ 1)2^{n-k}additions and subtractions,5.2^{n-k}multiplications, and2^{n-k}memory cells. The method may be very effective if there is an analytic expression for the characteristic Boolean functionh(x). This situation will be illustrated by several examples.Keywords
This publication has 5 references indexed in Scilit:
- An upper bound for self-dual codesInformation and Control, 1973
- Generalizations of Gleason's theorem on weight enumerators of self-dual codesIEEE Transactions on Information Theory, 1972
- A Generalized Technique for Spectral AnalysisIEEE Transactions on Computers, 1970
- Power moment identities on weight distributions in error correcting codesInformation and Control, 1963
- A Theorem on the Distribution of Weights in a Systematic Code†Bell System Technical Journal, 1963