On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
From MaRDI portal
Publication:6580182
DOI10.1142/S0219498825500768MaRDI QIDQ6580182
Nhan Nguyen, Nghia Tran, Hai Quang Dinh, Hieu V. Ha
Publication date: 29 July 2024
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Repeated-root constacyclic codes of length \(4\ell^{m}p^{n}\)
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- Repeated-root constacyclic codes of length
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- On repeated-root constacyclic codes of length \(4p^s\)
- The Minimum Hamming Distance of Cyclic Codes of Length 2p s
- A note on the q-ary image of a q/sup m/-ary repeated-root cyclic code
- Fundamentals of Error-Correcting Codes
- Weight distributions of cyclic self-dual codes
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580182)
