On the equivalence of linear cyclic and constacyclic codes

DOI10.1016/J.DISC.2023.113489zbMATH Open1521.94112arXiv2211.00897OpenAlexW4376111567MaRDI QIDQ6098080FDOQ6098080

Authors: Reza Dastbasteh, Petr Lisoněk 

Publication date: 12 June 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over finite fields. A necessary and sufficient condition for the monomial equivalence of linear cyclic codes through a shift map on their defining set is also given. Moreover, we provide new algebraic criteria for the monomial equivalence of constacyclic codes over $mathbb{F}_4$. Finally, we prove that if $gcd(3n,phi(3n))=1$, then all permutation equivalent constacyclic codes of length $n$ over $mathbb{F}_4$ are given by the action of multipliers. The results of this work allow us to prune the search algorithm for new linear codes and discover record-breaking linear and quantum codes.

Full work available at URL: https://arxiv.org/abs/2211.00897

Recommendations

• On the equivalence of linear codes
• A generalization of cyclic code equivalence algorithm to constacyclic codes
• scientific article; zbMATH DE number 139906
• scientific article; zbMATH DE number 3871184
• Equivalence classes and structures of constacyclic codes over finite fields
• Publication:3026906
• New linear codes from constacyclic codes
• On the equivalence of cyclic and quasi-cyclic codes over finite fields
• On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
• A new algorithm for equivalence of cyclic codes and its applications

zbMATH Keywords

permutation equivalencecyclic codeconstacyclic codemonomial equivalence

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cites Work

• The Magma algebra system. I: The user language
• An elementary proof of the MacWilliams theorem on equivalence of codes
• Fundamentals of Error-Correcting Codes
• Quantum error correction via codes over GF(4)
• Constacyclic codes over finite fields
• Constacyclic Codes and Some New Quantum MDS Codes
• Multipliers and generalized multipliers of cyclic objects and cyclic codes
• Quantum codes from nearly self-orthogonal quaternary linear codes
• Monomial isomorphisms of cyclic codes
• The theory of cyclic codes and a generalization to additive codes
• On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
• Pseudocyclic maximum-distance-separable codes
• Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes
• Coding theory
• On the equivalence of cyclic and quasi-cyclic codes over finite fields

Cited In (6)

• On the equivalence of cyclic and quasi-cyclic codes over finite fields
• A new algorithm for equivalence of cyclic codes and its applications
• A generalization of cyclic code equivalence algorithm to constacyclic codes
• On isometry and equivalence of skew constacyclic codes
• New quantum codes from CSS codes
• Monomial isomorphisms of cyclic codes

This page was built for publication: On the equivalence of linear cyclic and constacyclic codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098080)