On extendability of additive code isometries
From MaRDI portal
Publication:259263
DOI10.3934/amc.2016.10.45zbMath1352.94080arXiv1406.1714MaRDI QIDQ259263
Publication date: 11 March 2016
Published in: Advances in Mathematics of Communications, Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.1714
nonlinear codesadditive codeadditive codescode isometriesMacWilliams extension theoremsubspaces coveringcode isometry
Related Items
MacWilliams extension theorem for MDS codes over a vector space alphabet, Geometric approach to the MacWilliams extension theorem for codes over module alphabets, Minimal solutions of the isometry equation, Extension theorems for various weight functions over Frobenius bimodules
Cites Work
- Unnamed Item
- On metric rigidity for some classes of codes
- 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
- 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