Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions

DOI10.1109/TIT.2017.2753250zbMath1390.94893arXiv1605.03460MaRDI QIDQ4566592

Liren Lin, Bocong Chen, Hong-wei Liu

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.03460

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items (23)

Complete \(b\)-symbol weight distribution of some irreducible cyclic codes ⋮ The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes ⋮ Maximum distance separable codes for \(b\)-symbol read channels ⋮ 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 ⋮ Another expression of the MacWilliams identities and its applications ⋮ 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 ⋮ The \(b\)-symbol weight hierarchy of the Kasami codes ⋮ The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\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 ⋮ On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) ⋮ Constructions of new entanglement-assisted quantum MDS and almost MDS codes ⋮ 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 ⋮ The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes ⋮ MDS symbol-pair codes from repeated-root cyclic codes ⋮ On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\) ⋮ Construction of optimal codes from a class of constacyclic codes

This page was built for publication: Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions