Weights on finite fields and failures of the MacWilliams identities
By: Jay A. Wood
Potential Business Impact:
Finds new ways to fix errors in messages.
In the 1960s, MacWilliams proved that the Hamming weight enumerator of a linear code over a finite field completely determines, and is determined by, the Hamming weight enumerator of its dual code. In particular, if two linear codes have the same Hamming weight enumerator, then their dual codes have the same Hamming weight enumerator. In contrast, there is a wide class of weights on finite fields whose weight enumerators have the opposite behavior: there exist two linear codes having the same weight enumerator, but their dual codes have different weight enumerators.
Similar Papers
Weight Enumerators From Equivalence Relations and MacWilliams Identities
Information Theory
Makes computer codes stronger against errors.
Complete weight enumerators and weight hierarchies for linear codes from quadratic forms
Information Theory
Creates new codes for better error correction.
On the Hamming Weight Functions of Linear Codes
Information Theory
Creates new codes from existing ones.