Complete classification of cyclic codes of length 3ps over đ˝pm + uđ˝pm + u2đ˝pm
From MaRDI portal
Publication:6132237
DOI10.1142/s1793830922500914OpenAlexW4224239999MaRDI QIDQ6132237
Mohamed El Hassani Charkani, B. Boudine, Jamal Laaouine
Publication date: 14 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500914
Cites Work
- Unnamed Item
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Explicit factorizations of cyclotomic polynomials over finite fields
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- A note on cyclic codes over \(\mathrm{GR}(p^{2},m)\) of length \(p^{k}\)
- Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Complete classification of repeated-root \(\sigma\)-constacyclic codes of prime power length over \(\mathbb{F}_{p^m} [ u \slash \langle u^3 \rangle \)]
- Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)
- Complete classification of \((\delta + \alpha u^2)\)-constacyclic codes of length \(p^k\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} + u^2 \mathbb{F}_{p^m}\)
- Cyclic and negacyclic codes of length \(2p^s\) over \(\mathbb F_{p^m}+u\mathbb F_{p^m}\)
- Completely primary rings. IV. Chain conditions
- ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
- Calculating cyclotomic polynomials
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Class Field Theory
- Explicit constructions of cyclic and negacyclic codes of length 3ps over đ˝pm + uđ˝pm
This page was built for publication: Complete classification of cyclic codes of length 3ps over đ˝pm + uđ˝pm + u2đ˝pm
