Abstract : The Extension Theorem states that, for a given weight on he alphabet, every linear isometry between linear codes extends to a mono- mial transformation of the entire space. This theorem has been proved for several weights and alphabets, including the original MacWilliams' Equivalence Theorem for Hamming weight on codes over nite elds. Now we ask: 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 [5].
https://hal.inria.fr/inria-00607730
Contributeur : Assia Saadi
<>
Soumis le : lundi 11 juillet 2011 - 10:13:17
Dernière modification le : mercredi 29 novembre 2017 - 10:27:36
Document(s) archivé(s) le : lundi 12 novembre 2012 - 10:40:17
Cathy Mc Fadden, Marcus Greferath, Jens Zumbragel. Characteristics of Invariant Weights Related to Code Equivalence over Rings. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.91-100, 2011. 〈inria-00607730〉
