New constructions of MDS symbol-pair codes

From MaRDI portal



Abstract: Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with the largest minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining the maximal minimum pair-distance is called a maximum distance separable (MDS) symbol-pair code. In this paper, we focus on constructing linear MDS symbol-pair codes over the finite field mathbbFq. We show that a linear MDS symbol-pair code over mathbbFq with pair-distance 5 exists if and only if the length n ranges from 5 to q2+q+1. As for codes with pair-distance 6, length ranging from 6 to q2+1, we construct linear MDS symbol-pair codes by using a configuration called ovoid in projective geometry. With the help of elliptic curves, we present a construction of linear MDS symbol-pair codes for any pair-distance d+2 with length n satisfying 7led+2leqnleq+lfloor2sqrtqfloor+delta(q)−3, where delta(q)=0 or 1.





Cited in
(21)








This page was built for publication: New constructions of MDS symbol-pair codes

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