Non-invertible-element constacyclic codes over finite PIRs (Q1979945): Difference between revisions

In this paper under review, the authors introduce the notion of \(\lambda\)-constacyclic codes over finite rings \(R\) for arbitrary nonzero element \(\lambda\) of \(R\), which extend the known concept on constacyclic codes over finite rings. They study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal rings (PIRs); determine the algebraic structures of all NIE-constacyclic codes over finite chain rings; give the unique form of the sets of the defining polynomials and obtain their minimum Hamming distances. A general form of the duals of NIE-constacyclic codes over finite chain rings is also provided. In particular, the authors also give a necessary and sufficient condition for the dual of an NIE-constacyclic code to be an NIE-constacyclic code. Using the Chinese Remainder Theorem, they study the NIE-constacyclic codes over finite PIRs. Furthermore, the authors construct some optimal NIE-constacyclic codes over finite PIRs in the sense that they achieve the maximum possible minimum Hamming distances for some given lengths and cardinalities.