On extendability of additive code isometries

DOI10.1007/978-3-319-17296-5_17zbMATH Open1352.94080arXiv1406.1714OpenAlexW2952247110MaRDI QIDQ259263FDOQ259263

Serhii Dyshko

Publication date: 11 March 2016

Published in: Advances in Mathematics of Communications, Coding Theory and Applications (Search for Journal in Brave)

Abstract: For linear codes, the MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a linear isometry of the whole space. But, in general, it is not the situation for nonlinear codes. In this paper it is proved, that if the length of an additive code is less than some threshold value, then an analogue of the MacWilliams Extension Theorem holds. One family of unextendible code isometries for the threshold value of code length is described.

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

zbMATH Keywords

additive codeadditive codescode isometriescode isometryMacWilliams extension theoremnonlinear codessubspaces covering

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of packing and covering (05B40)

Cites Work

• On the extendability of code isometries
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Characters and the equivalence of codes
• To the metrical rigidity of binary codes
• On the concept of code-isomorphy
• On the equivalence of codes over rings and modules
• Covering Numbers in Linear Algebra
• FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
• Title not available (Why is that?)
• An elementary proof of the MacWilliams theorem on equivalence of codes
• Duality for modules over finite rings and applications to coding theory
• FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• On the representation of vector spaces as a finite union of subspaces
• On metric rigidity for some classes of codes

Cited In (5)

• Geometric approach to the MacWilliams extension theorem for codes over module alphabets
• Minimal solutions of the isometry equation
• On addition and multiplication with Hensel codes
• Extension theorems for various weight functions over Frobenius bimodules
• MacWilliams extension theorem for MDS codes over a vector space alphabet

This page was built for publication: On extendability of additive code isometries

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