When isometry and equivalence for skew constacyclic codes coincide
By: Monica Nevins, Susanne Pumpluen
Potential Business Impact:
Makes math codes easier to compare and sort.
We show that the notions of $(n,\sigma)$-isometry and $(n,\sigma)$-equivalence introduced by Ou-azzou et al coincide for most skew $(\sigma,a)$-constacyclic codes of length $n$. To prove this, we show that all Hamming-weight-preserving homomorphisms between their ambient algebras must have degree one when those algebras are nonassociative. We work in the general setting of commutative base rings $S$. As a consequence, we propose new definitions of equivalence and isometry of skew constacyclic codes that exactly capture all Hamming-preserving isomorphisms, and lead to tighter classifications. In the process we determine homomorphisms between nonassociative Petit algebras, prioritizing the algebras $S[t;\sigma]/S[t;\sigma](t^n-a)$, which give rise to skew constacyclic codes.
Similar Papers
Using nonassociative algebras to classify skew polycyclic codes up to isometry and equivalence
Information Theory
Makes computer codes more efficient and unique.
A Construction of Infinite Families of Self-Orthogonal Quasi-Cyclic Codes Using Constituent Codes.pdf
Information Theory
Makes computers better at fixing errors.
A Construction of Infinite Families of Self-Orthogonal Quasi-Cyclic Codes Using Constituent Codes.pdf
Information Theory
Makes computers better at fixing errors in data.