Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)
From MaRDI portal
Publication:6495858
DOI10.1016/J.FFA.2024.102420MaRDI QIDQ6495858
Nhan Nguyen, Hieu V. Ha, Hai Quang Dinh, Thieu N. Vo, Nghia Tran
Publication date: 2 May 2024
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Polynomials over finite fields (11T06) Cyclic codes (94B15)
Cites Work
- 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 \(\ell p^s\) and their duals
- 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 4ps
- 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
- Weight distributions of cyclic self-dual codes
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\)