The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
From MaRDI portal
Publication:2053125
DOI10.1007/s12190-020-01383-yzbMath1484.94031OpenAlexW3037085029MaRDI QIDQ2053125
Publication date: 29 November 2021
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-020-01383-y
Cites Work
- On constacyclic codes over finite fields
- A class of constacyclic codes over a finite field. II
- Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- Constacyclic codes over finite fields
- Repeated-root constacyclic codes of length \(\ell^{t}p^{s}\) and their dual codes
- On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
- On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
- A coding theory construction of new systematic authentication codes
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
- Weight distributions of cyclic codes of length \(t l^m\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- The Minimum Hamming Distance of Cyclic Codes of Length 2p s
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
- On repeated-root cyclic codes
- Repeated-root cyclic codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
