Two New Classes of MDS Symbol-Pair Codes

Due to the application of high density data storage systems, symbol-pair codes are proposed to combat errors of the overlapping symbol pairs output over symbol-pair read channels. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense that they have the highest pair error-correcting capability. In this paper, we construct two new classes of MDS symbol-pair codes with minimum pair distance seven based on simple-root cyclic codes. Our technique is through the decomposition of cyclic codes and the dual of each component code.