Complete classification of negacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}+ u^2 \mathbb{F}_{p^m} \)
From MaRDI portal
Publication:6650403
DOI10.1142/s1793557123500110MaRDI QIDQ6650403
Mohamed El Hassani Charkani, B. Boudine, Jamal Laaouine
Publication date: 9 December 2024
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06) Cyclic codes (94B15) Cyclotomy (11T22)
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} \)
- 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
- Cyclic codes with generalized cyclotomic cubic classes
- Explicit constructions of cyclic and negacyclic codes of length 3ps over đ˝pm + uđ˝pm
This page was built for publication: Complete classification of negacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}+ u^2 \mathbb{F}_{p^m} \)
