Abstract

AbstractWe will say that an alphabet A satisfies the extension property with respect to a weight w if every linear isomorphism between two linear codes in A n that preserves w extends to a monomial transformation of A n. In the 1960s MacWilliams proved that finite fields have the extension property with respect to Hamming weight. It is known that a module A has the extension property with respect to Hamming weight or a homogeneous weight if and only if A is pseudo-injective and embeds into \(\hat{R}\). The main theorem presented in this paper gives a sufficient condition for an alphabet to have the extension property with respect to symmetrized weight compositions. It has already been proven that a Frobenius bimodule has the extension property with respect to symmetrized weight compositions. This result follows from the main theorem.KeywordsLinear codes over finite modulesExtension theoremSymmetrized weight composition

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.