AMDS symbol-pair codes from repeated-root cyclic codes

DOI10.1016/J.DISC.2023.113391MaRDI QIDQ6046166zbMATH OpenOpenAlexFDO

Authors Junru Ma, Jinquan Luo

Publication date 15 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

AMDS symbol-pair codescyclic codesminimum symbol-pair distancerepeated-root cyclic codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Other types of codes (94B60)

Abstract: Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance is of significance in determining the error-correcting capability of a symbol-pair code. One of the central themes in symbol-pair coding theory is the constructions of symbol-pair codes with largest possible minimum pair distance. Maximum distance separable (MDS) and almost maximum distance separable (AMDS) symbol-pair codes are optimal and sub-optimal regarding to the Singleton bound, respectively. In this paper, six new classes of AMDS symbol-pair codes are explicitly constructed through repeated-root cyclic codes and one class of such codes has unbounded lengths and the minimum symbol-pair distance can reach $13$.

Recommendations

• MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
• MDS symbol-pair codes from repeated-root cyclic codes
• Constructions of MDS symbol-pair codes with minimum distance seven or eight
• Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
• The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)

Cites work

• A Construction of New MDS Symbol-Pair Codes
• Bounds and Constructions of Codes Over Symbol-Pair Read Channels
• Codes for Symbol-Pair Read Channels
• Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
• Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
• Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
• Constructions of MDS symbol-pair codes with minimum distance seven or eight
• Geometric Approach tob-Symbol Hamming Weights of Cyclic Codes
• List Decodability of Symbol-Pair Codes
• Maximum Distance Separable Codes for Symbol-Pair Read Channels
• MDS symbol-pair codes from repeated-root cyclic codes
• MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
• New constructions of MDS symbol-pair codes
• On repeated-root cyclic codes
• On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
• On the Symbol-Pair 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\)
• The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)

Cited in

(6)

• MDS symbol-pair codes from repeated-root cyclic codes
• MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
• The \(b\)-symbol weight hierarchies of two families of cyclic codes over \(\mathbb{F}_q\)
• A new family of AMDS symbol-pair constacyclic codes of length 4p and symbol-pair distance 9p
• 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: AMDS symbol-pair codes from repeated-root cyclic codes

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