New MDS Symbol-Pair Codes from Repeated-Root Cyclic Codes over Finite Fields
Symbol-pair codes are introduced to guard against pair-errors in symbol-pair read channels. One main task in symbol-pair coding theory is to design codes with large minimum symbol-pair distance. Maximum distance separable ( MDS ) symbol-pair codes are optimal in the sense that such codes attain the Singleton bound. In this paper, three new classes of MDS symbol-pair codes with minimum symbol-pair distance seven or eight are proposed by virtue of repeated-root cyclic codes. The main results are obtained by determining the solutions of certain equations over finite fields.
READ FULL TEXT