When isometry and equivalence for skew constacyclic codes coincide
This is an incremental theoretical result for coding theory researchers, clarifying the relationship between isometry and equivalence in skew constacyclic codes.
The paper proves that for most skew constacyclic codes over a commutative base ring, the concepts of isometry and equivalence coincide, leading to tighter code classifications.
We work in the setting of linear skew constacyclic codes over a commutative base ring $S$. We show that the notions of $(n,σ)$-isometry and $(n,σ)$-equivalence introduced by Ou-azzou et al coincide for most skew $(σ,a)$-constacyclic codes of length $n$. To prove this, we show that all Hamming-weight preserving isomorphisms between their ambient rings which extend some automorphism $τ$ of $S$ that commutes with $σ$ must have degree one, when those rings are not associative. In the process we determine isomorphisms between their nonassociative ambient rings, the Petit rings $S[t;σ]/S[t;σ](t^n-a)$, which give rise to skew constacyclic codes. As a consequence, we propose new definitions of equivalence and isometry of skew constacyclic codes that exactly capture all Hamming-weight preserving isomorphisms between the ambient rings of skew constacyclic codes which extend $τ\in {\rm Aut}(S)$ that commute with $σ$, and lead to tighter classifications.