Equivalence of constacyclic codes with shift constants of different orders

Let a and b be two non-zero elements of a finite field Fq, where q>2. It has been shown that if a and b have the same multiplicative order in Fq, then the families of a-constacyclic and b-constacyclic codes over Fq are monomially equivalent. In this paper, we investigate the monomial equivalence of a-constacyclic and b-constacyclic codes when a and b have distinct multiplicative orders. We present novel conditions for establishing monomial equivalence in such constacyclic codes, surpassing previous methods of determining monomially equivalent constacyclic and cyclic codes. As an application, we use these results to search for new linear codes more systematically. In particular, we present more than 70 new record-breaking linear codes over various finite fields, as well as new binary quantum codes.