The Minimum Hamming Distance of Cyclic Codes of Length 2p s
From MaRDI portal
Publication:3656816
DOI10.1007/978-3-642-02181-7_10zbMath1273.94409arXiv0906.4008OpenAlexW1541021634MaRDI QIDQ3656816
Publication date: 14 January 2010
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.4008
Related Items (11)
Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes ⋮ On non-binary quantum repeated-root cyclic codes ⋮ Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\) ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) ⋮ On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) ⋮ Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds ⋮ Hamming distances of constacyclic codes of length \(7p^s\) over \(\mathbb{F}_{p^m}\) ⋮ The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes ⋮ Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \) ⋮ Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) ⋮ Two new families of quantum synchronizable codes
This page was built for publication: The Minimum Hamming Distance of Cyclic Codes of Length 2p s
