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

From MaRDI portal
Publication:6156915

DOI10.1016/J.FFA.2023.102203zbMATH Open1516.94071arXiv2206.00462OpenAlexW4366505927MaRDI QIDQ6156915FDOQ6156915


Authors: Xiuxin Tang, Rong Luo Edit this on Wikidata


Publication date: 19 June 2023

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

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.


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




Recommendations




Cites Work


Cited In (8)





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)