On negacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
From MaRDI portal
Publication:6625102
DOI10.61091/JCMCC122-29MaRDI QIDQ6625102
Youssef Ahendouz, Ismail Akharraz
Publication date: 28 October 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Cites Work
- On constacyclic codes of length \(4p^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}\)
- Repeated-root constacyclic codes of length
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
This page was built for publication: On negacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625102)
