Skip to Main content Skip to Navigation
Conference papers

Characteristics of Invariant Weights Related to Code Equivalence over Rings

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].
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Assia Saadi Connect in order to contact the contributor
Submitted on : Monday, July 11, 2011 - 10:13:17 AM
Last modification on : Wednesday, November 29, 2017 - 10:27:36 AM
Long-term archiving on: : Monday, November 12, 2012 - 10:40:17 AM


Files produced by the author(s)


  • HAL Id : inria-00607730, version 1



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. ⟨inria-00607730⟩



Record views


Files downloads