Characteristics of invariant weights related to code equivalence over rings

DOI10.1007/s10623-012-9671-9zbMath1259.94068arXiv1110.1538MaRDI QIDQ1934233

Jens Zumbrägel, Cathy Mc Fadden, Marcus Greferath

Publication date: 28 January 2013

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.1538

zbMATH Keywords

weights; extension theorem; MacWilliams equivalence theorem; ring-linear codes

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94B05: Linear codes (general theory)

05E99: Algebraic combinatorics

Related Items

Isometry groups of additive codes over finite fields, THE SEMIPRIMENESS OF SEMIGROUP RINGS, Unnamed Item, The extension theorem for bi-invariant weights over Frobenius rings and Frobenius bimodules, MacWilliams extension theorems and the local-global property for codes over Frobenius rings, Two approaches to the extension problem for arbitrary weights over finite module alphabets, MacWilliams extension property for arbitrary weights on linear codes over module alphabets, MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings, The Extension Theorem with Respect to Symmetrized Weight Compositions

Cites Work

• Weighted modules and representations of codes
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Characters and the equivalence of codes
• On the concept of code-isomorphy
• Duality for modules over finite rings and applications to coding theory
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
• Code equivalence characterizes finite Frobenius rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item