Characteristics of invariant weights related to code equivalence over rings

DOI10.1007/S10623-012-9671-9MaRDI QIDQ1934233zbMATH OpenOpenAlexFDO

Authors Marcus Greferath, Cathy Mc Fadden, Jens Zumbrägel

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

extension theoremMacWilliams equivalence theoremring-linear codesweights

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Abstract: The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets, including the original MacWilliams' Equivalence Theorem for the Hamming weight on codes over finite fields. The question remains: What conditions must a weight satisfy so that the Extension Theorem will hold? In this paper we provide an algebraic framework for determining such conditions, generalising the approach taken in [Greferath, Honold '06].

Recommendations

• Generalized Hamming weights and equivalences of codes
• Two approaches to the extension problem for arbitrary weights over finite module alphabets
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• New code equivalence based on relative generalized Hamming weights
• MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings

Cites work

• Characters and the equivalence of codes
• Code equivalence characterizes finite Frobenius rings
• Duality for modules over finite rings and applications to coding theory
• FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 1188994 (Why is no real title available?)
• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• scientific article; zbMATH DE number 3460471 (Why is no real title available?)
• scientific article; zbMATH DE number 2077103 (Why is no real title available?)
• scientific article; zbMATH DE number 1461548 (Why is no real title available?)
• On the concept of code-isomorphy
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Weighted modules and representations of codes

Cited in

(11)

• Characters and the equivalence of codes
• 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
• Isometry groups of additive codes over finite fields
• MacWilliams extension theorems and the local-global property for codes over Frobenius rings
• THE SEMIPRIMENESS OF SEMIGROUP RINGS
• The extension theorem for bi-invariant weights over Frobenius rings and Frobenius bimodules
• The extension problem for Lee and Euclidean weights
• Generalized Hamming weights and equivalences of codes

This page was built for publication: Characteristics of invariant weights related to code equivalence over rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1934233)