pith. sign in

arxiv: 1608.02687 · v1 · pith:OUCQATBInew · submitted 2016-08-09 · 💻 cs.IT · math.CO· math.IT

Constructions of Maximum Distance Separable Symbol-Pair Codes Using Cyclic and Constacyclic Codes

classification 💻 cs.IT math.COmath.IT
keywords codessymbol-paircyclicconditionconstacyclicdistancefractionalkind
0
0 comments X
read the original abstract

Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction capability. Employing cyclic and constacyclic codes, we construct three new classes of MDS symbol-pair codes with minimum pair-distance five or six. Moreover, we find a necessary and sufficient condition which ensures a class of cyclic codes to be MDS symbol-pair codes. This condition is related to certain property of a special kind of linear fractional transformations. A detailed analysis on these linear fractional transformations leads to an algorithm, which produces many MDS symbol-pair codes with minimum pair-distance seven.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.