Isometry groups of additive codes over finite fields

DOI10.1142/S0219498818501980zbMath1403.94114OpenAlexW2766263984MaRDI QIDQ4561489

Jay A. Wood

Publication date: 6 December 2018

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498818501980

zbMATH Keywords

isometryadditive codeclosureextension property

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (3)

On quantum stabilizer codes derived from local Frobenius rings ⋮ Symplectic isometries of stabilizer codes ⋮ Isometry groups of combinatorial codes

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two analogues of Maillet's determinant
• Codes and projective multisets
• The Magma algebra system. I: The user language
• On the extendability of code isometries
• Small additive quaternary codes.
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Isometry groups of combinatorial codes
• Characteristics of invariant weights related to code equivalence over rings
• Linear codes over finite chain rings
• MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
• The structure of linear codes of constant weight
• FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
• Duality for modules over finite rings and applications to coding theory
• FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
• Geometric approach to higher weights
• Code equivalence characterizes finite Frobenius rings

This page was built for publication: Isometry groups of additive codes over finite fields