A multiset approach to MacWilliams identities
Hopein Christofen Tang
公開日: 2025/9/25
Abstract
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.