Non-invertible-element constacyclic codes over finite PIRs
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.
- A class of linear codes of length 2 over finite chain rings
- A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u] / \langle u^e \rangle\) of type 2
- A linear construction for certain Kerdock and Preparata codes
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Cyclic and negacyclic codes over the Galois ring \(\text{GR}(p^2,m)\)
- Cyclic codes over \(\mathbb Z_4\) of even length
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Finite rings with applications.
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- Kerdock code in a cyclic form
- MDS codes over finite principal ideal rings
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- On constacyclic codes over \(\mathbb{Z}_4 [u] / \langle u^2 - 1 \rangle\) and their Gray images
- On modular cyclic codes
- On the structure of linear and cyclic codes over a finite chain ring
- Quasi-twisted codes with constacyclic constituent codes
- Repeated-root constacyclic codes of length k p^s
- Some Repeated-Root Constacyclic Codes Over Galois Rings
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
This page was built for publication: Non-invertible-element constacyclic codes over finite PIRs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979945)
