On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
From MaRDI portal
Publication:6080544
DOI10.1016/j.disc.2023.113593MaRDI QIDQ6080544
Woraphon Yamaka, Hai Quang Dinh, Bac T. Nguyen, Hiep L. Thi
Publication date: 4 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Finite commutative rings (13M99)
Cites Work
- Unnamed Item
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u/\langle u^m\rangle\)]
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Codes of small defect
- Almost MDS codes
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^e \rangle\) of type 2]
- Maximum distance separable codes for \(b\)-symbol read channels
- Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their duals
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- On near-MDS codes
- Repeated-root constacyclic codes of length \(3 \ell^m p^s\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- How to share a secret
- On the generators of Z/sub 4/ cyclic codes of length 2/sup e/
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- On cyclic MDS codes of length q over GF(q) (Corresp.)
- Semisimple cyclic and Abelian codes. II
- A characterization of codes with extreme parameters
- Fundamentals of Error-Correcting Codes
- On the Hamming distance of linear codes over a finite chain ring
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Codes for Symbol-Pair Read Channels
- On a class of constacyclic codes of length 4ps over 𝔽pm + u𝔽pm
- On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)