Structure of repeated-root constacyclic codes of length 8ℓmpn
From MaRDI portal
Publication:5223079
DOI10.1142/S1793557119500505zbMath1452.94125OpenAlexW2796901457MaRDI QIDQ5223079
Publication date: 5 July 2019
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557119500505
Related Items
Repeated-root constacyclic codes of length \(6l^mp^n\), Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- On constacyclic codes over finite fields
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- Constacyclic codes over finite fields
- A class of constacyclic codes over a finite field
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
- Polyadic codes of prime power length
- Repeated-Root Isodual Cyclic Codes over Finite Fields
- The gray image of the cyclic codes over
- On (1 −u2)-cyclic and cyclic codes overIFp+uIFp+u2IFp
- A class of minimal cyclic codes over finite fields