On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
From MaRDI portal
Publication:1732780
DOI10.1016/J.DISC.2019.01.023zbMath1441.94104OpenAlexW2914007647MaRDI QIDQ1732780
Xiaoqiang Wang, Songsak Sriboonchitta, Hai Quang Dinh, Hong-wei Liu
Publication date: 25 March 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.01.023
Related Items (12)
A class of binary cyclic codes with optimal parameters ⋮ On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ A class of skew cyclic codes and application in quantum codes construction ⋮ Quantum codes from a class of constacyclic codes over finite commutative rings ⋮ Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \) ⋮ Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds ⋮ Quantum codes from skew constacyclic codes over the ring \(\mathbb{F}_q [u, v \slash \langle u^2 - 1, v^2 - 1, u v - v u \rangle \)] ⋮ On matrix-product structure of repeated-root constacyclic codes over finite fields ⋮ The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes ⋮ On Hamming and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\) ⋮ 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}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Repeated-root constacyclic codes of length
- A class of constacyclic codes over a finite field
- New constructions of MDS symbol-pair 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\)
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
- A Construction of New MDS Symbol-Pair Codes
- Equivalence Classes and Structures of Constacyclic Codes Over Finite Fields
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$
- 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
- Fundamentals of Error-Correcting Codes
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- Codes for Symbol-Pair Read Channels
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)
