MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
From MaRDI portal
Publication:2451899
DOI10.1016/j.jcta.2014.03.005zbMath1302.94066arXiv1309.3292OpenAlexW2963430254MaRDI QIDQ2451899
Thomas Honold, Cathy Mc Fadden, Marcus Greferath, Jay A. Wood, Jens Zumbrägel
Publication date: 26 May 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.3292
Finite rings and finite-dimensional associative algebras (16P10) Linear codes (general theory) (94B05) Quasi-Frobenius rings (16L60)
Related Items (12)
A transform approach to polycyclic and serial codes over rings ⋮ Induced weights on quotient modules and an application to error correction in coherent networks ⋮ The Extension Theorem with Respect to Symmetrized Weight Compositions ⋮ Isometry groups of additive codes over finite fields ⋮ Unnamed Item ⋮ The extension theorem for Lee and Euclidean weight codes over integer residue rings ⋮ MacWilliams' extension theorem for rank-metric codes ⋮ When the extension property does not hold ⋮ Two approaches to the extension problem for arbitrary weights over finite module alphabets ⋮ The extension theorem for bi-invariant weights over Frobenius rings and Frobenius bimodules ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ MacWilliams extension property for arbitrary weights on linear codes over module alphabets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem
- A metric for codes over residue class rings
- Weighted modules and representations of codes
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- Characteristics of invariant weights related to code equivalence over rings
- Combinatorial theory.
- FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
- An elementary proof of the MacWilliams theorem on equivalence of codes
- Duality for modules over finite rings and applications to coding theory
- FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
- FINITE PRINCIPAL IDEAL RINGS
- Code equivalence characterizes finite Frobenius rings
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Characterization of finite Frobenius rings
This page was built for publication: MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings