Isometry groups of combinatorial codes
From MaRDI portal
Abstract: Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes, where these groups are the same, it is shown that for combinatorial codes the groups can be arbitrary different. Particularly, there exist codes with the full automorphism group and the trivial monomial automorphism group. In the paper the two groups are characterized and codes with predefined isometry groups are constructed.
Recommendations
Cites work
- Code equivalence characterizes finite Frobenius rings
- FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
- On metric rigidity for some classes of codes
- On the concept of code-isomorphy
- On the equivalence of codes over rings and modules
- On the extendability of code isometries
- To the metrical rigidity of binary codes
Cited in
(9)- Isometry and automorphisms of constant dimension codes
- Permutation codes invariant under isometries
- On the concept of code-isomorphy
- Isometry groups of Hamming spaces of periodic sequences
- Isometry groups of additive codes over finite fields
- Isometry groups of combinatorial codes
- MacWilliams extension theorem for MDS codes over a vector space alphabet
- scientific article; zbMATH DE number 6783478 (Why is no real title available?)
- scientific article; zbMATH DE number 971755 (Why is no real title available?)
This page was built for publication: Isometry groups of combinatorial codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743290)