The Hamming distances of repeated-root cyclic codes of length \(5 p^s\)
From MaRDI portal
Publication:777357
DOI10.1016/J.DAM.2020.03.026zbMath1476.94050arXiv1911.07542OpenAlexW3011283939MaRDI QIDQ777357
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07542
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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}\)
- 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\)
- A coding theory construction of new systematic authentication codes
- 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
- 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
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- On Quantum and Classical BCH Codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes
- Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: The Hamming distances of repeated-root cyclic codes of length \(5 p^s\)
