Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions

DOI10.1109/TIT.2017.2753250MaRDI QIDQ4566592zbMATH OpenFDO

Authors Bocong Chen, Liren Lin, Hongwei 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)

Abstract: Symbol-pair codes introduced by Cassuto and Blaum (2010) are designed to protect against pair errors in symbol-pair read channels. The higher the minimum pair distance, the more pair errors the code can correct. MDS symbol-pair codes are optimal in the sense that pair distance cannot be improved for given length and code size. The contribution of this paper is twofold. First we present three lower bounds for the minimum pair distance of constacyclic codes, the first two of which generalize the previously known results due to Cassuto and Blaum (2011) and Kai {it et al.} (2015). The third one exhibits a lower bound for the minimum pair distance of repeated-root cyclic codes. Second we obtain new MDS symbol-pair codes with minimum pair distance seven and eight through repeated-root cyclic codes.

Cited in

(38)

• Maximum distance separable codes for b-symbol read channels
• The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)
• On the Hamming distances of repeated-root constacyclic codes of length 4p^s
• On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
• 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
• Construction of optimal codes from a class of constacyclic codes
• Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
• The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes
• On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
• On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
• Constructions of MDS symbol-pair codes with minimum distance seven or eight
• 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
• scientific article; zbMATH DE number 1504685 (Why is no real title available?)
• Optimal b-symbol constacyclic codes with respect to the Singleton bound
• Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
• 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
• Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
• The \(b\)-weight distribution for MDS codes
• Repeated-root constacyclic codes of length k^s l^m p^n over finite fields
• Constructions of new entanglement-assisted quantum MDS and almost MDS codes
• Lee metric codes for symbol-pair read channels
• Several new classes of MDS symbol-pair codes
• New constructions of MDS symbol-pair codes via simple-root cyclic codes
• On a class of constacyclic codes and MDS code construction over \(\frac{\mathbb{F}_{p^m} [u, v]}{\langle u^2 - \delta u, v^2 - \gamma v, uv - vu \rangle}\)
• Some bounds on the cardinality of the b-symbol weight spectrum of codes
• A new family of AMDS symbol-pair constacyclic codes of length 4p and symbol-pair distance 9p
• Bounds and constructions of optimal symbol-pair codes with constant pair-weight
• On symbol-pair distance distributions of repeated-root constacyclic codes of length 4p^s and MDS codes
• Two new classes of AMDS symbol-pair cyclic codes of length 4p
• A new class of AMDS symbol-pair codes from repeated-root codes
• New constructions of optimal symbol-pair constacyclic codes of length 4p^s

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566592)