arXiv (All)
open access
A multiset approach to MacWilliams identities
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Balanced Gray Codes for Permutations and Rainbow Cycles for Associahedra#1014533
- Quantizing Delsarte Theory#1234267
- Combinatorial twisted bialgebras and combinatorial twisted double bialgebras#1202675
- New Hoffman-type generators for alternating multiple zeta values#1248801
- Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)#1033960
Record · ID 1344458
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive