MDS Symbol-Pair Codes from Repeated-Root Cyclic Codes

DOI10.1007/S10623-021-00967-4MaRDI QIDQ6355648arXivFDO

Authors Junru Ma, Jinquan Luo

Publication date 9 December 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10623-021-00967-4

Mathematics Subject Classification ID

Cyclic codes (94B15)

arXiv classification

cs.ITmath.IT

Abstract: Symbol-pair codes are proposed to combat 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. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense that such codes can achieve the Singleton bound. In this paper, two new classes of MDS symbol-pair codes are proposed utilizing repeated-root cyclic codes over finite fields with odd characteristic. Precisely, these codes poss minimum symbol-pair distance ten or twelve, which is bigger than all the known MDS symbol-pair codes from constacyclic codes.

This page was built for publication: MDS 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 Q6355648)