On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
From MaRDI portal
Publication:4569193
DOI10.1109/TIT.2017.2726691zbMath1390.94894OpenAlexW2735920813MaRDI QIDQ4569193
Songsak Sriboonchitta, Abhay Kumar Singh, Bac T. Nguyen, Hai Quang Dinh
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2017.2726691
Related Items (21)
Constructions of MDS symbol-pair codes with minimum distance seven or eight ⋮ AMDS symbol-pair codes from repeated-root cyclic codes ⋮ On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codes ⋮ On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring ⋮ Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\) ⋮ MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes ⋮ A note on: ``Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\) ⋮ MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\) ⋮ Cyclic codes of length \(5p\) with MDS symbol-pair ⋮ Optimal b-symbol constacyclic codes with respect to the Singleton bound ⋮ Symbol-triple distance of repeated-root constacyclic codes of prime power lengths ⋮ Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds ⋮ On symbol-pair weight distribution of MDS codes and simplex codes over finite fields ⋮ On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths ⋮ 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}\) ⋮ MDS symbol-pair codes from repeated-root cyclic codes ⋮ On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\) ⋮ 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}\) ⋮ Construction of optimal codes from a class of constacyclic codes
This page was built for publication: On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
