On the equivalence of linear cyclic and constacyclic codes.

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. Finally, we prove that if gcd ⁡ (3 n , ϕ (3 n)) = 1 , where ϕ is the Euler's totient function, then all permutation equivalent constacyclic codes of length n over 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. [ABSTRACT FROM AUTHOR]