Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
From MaRDI portal
Publication:4554567
DOI10.1142/S1793830918500362zbMath1398.94231OpenAlexW2806119675MaRDI QIDQ4554567
Publication date: 14 November 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830918500362
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Some constacyclic codes over finite chain rings
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- Negacyclic codes of length \(2p^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}\)
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- Cyclic and negacyclic codes over the Galois ring \(\text{GR}(p^2,m)\)
- On the structure of linear and cyclic codes over a finite chain ring
- All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Cyclic and negacyclic codes of length \(2p^s\) over \(\mathbb F_{p^m}+u\mathbb F_{p^m}\)
- Kerdock code in a cyclic form
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Negacyclic Codes of Length<tex>$2^s$</tex>Over Galois Rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- A linear construction for certain Kerdock and Preparata codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pm
This page was built for publication: Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m)
