A multiset approach to MacWilliams identities
By: Hopein Christofen Tang
Potential Business Impact:
Finds new math rules for better computer codes.
We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The proof and the identity are expressed in combinatorial terms that do not require generating characters. We also generalize the symmetrized weight enumerator with respect to supports and codeword tuples, and our multiset approach enables us to derive new and general MacWilliams identities expressed in combinatorial terms.
Similar Papers
Codes over Finite Ring $\mathbb{Z}_k$, MacWilliams Identity and Theta Function
Information Theory
Makes codes stronger for better data protection.
Weight Enumerators From Equivalence Relations and MacWilliams Identities
Information Theory
Makes computer codes stronger against errors.
MacWilliams Theory over Zk and nu-functions over Lattices
Information Theory
Finds new math rules for error-correcting codes.