MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes

DOI10.1016/J.FFA.2023.102203MaRDI QIDQ6156915zbMATH OpenOpenAlexFDO

Authors Xiuxin Tang, Rong Luo

Publication date 19 June 2023

Published in Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

repeated-root cyclic codesMDS symbol-pair codesAMDS symbol-pair codesminimum symbol-pair distance

Mathematics Subject Classification ID

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

Abstract: Symbol-pair codes introduced by Cassuto and Blaum in 2010 are designed to protect against the pair errors in symbol-pair read channels. One of the central themes in symbol-error correction is the construction of maximal distance separable (MDS) symbol-pair codes that possess the largest possible pair-error correcting performance. Based on repeated-root cyclic codes, we construct two classes of MDS symbol-pair codes for more general generator polynomials and also give a new class of almost MDS (AMDS) symbol-pair codes with the length $lp$. In addition, we derive all MDS and AMDS symbol-pair codes with length $3p$, when the degree of the generator polynomials is no more than 10. The main results are obtained by determining the solutions of certain equations over finite fields.

Recommendations

• MDS symbol-pair codes from repeated-root cyclic codes
• AMDS symbol-pair codes from repeated-root cyclic codes
• A Construction of New MDS Symbol-Pair Codes
• New constructions of MDS symbol-pair codes
• MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
• scientific article; zbMATH DE number 1488178
• scientific article; zbMATH DE number 3891252
• On the existence of cyclic and pseudo-cyclic MDS codes
• MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
• 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

Cites work

• A Construction of New MDS Symbol-Pair Codes
• AMDS symbol-pair codes from repeated-root cyclic codes
• Codes for Symbol-Pair Read Channels
• Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
• Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
• Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights
• MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
• MDS symbol-pair codes from repeated-root cyclic codes
• Maximum Distance Separable Codes for Symbol-Pair Read Channels
• On repeated-root cyclic codes
• On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths

Cited in

(8)

• Cyclic codes of length \(5p\) with MDS symbol-pair
• New constructions of MDS symbol-pair codes
• MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
• \(b\)-symbol distance distribution of repeated-root cyclic codes
• AMDS symbol-pair codes from repeated-root cyclic codes
• Constructions of MDS symbol-pair codes with minimum distance seven or eight
• MDS symbol-pair codes from repeated-root cyclic codes
• Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes

This page was built for publication: MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes

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