Symbol-pair codes are proposed to protect against pair-errors in symbol-pair read channels. The research of symbol-pair codes with the largest possible minimum symbol-pair distance is of great significance since such codes have the best error-correcting capability. A symbol-pair code meeting the Singleton bound is called a maximum distance separable (MDS) symbol-pair code. In this paper, two new classes of MDS symbol-pair codes are proposed by utilizing repeated-root cyclic codes over finite fields with odd characteristic. It should be noted that these codes have minimum symbol-pair distance ten or twelve.

中文翻译：

---

来自重复根循环码的 MDS 符号对码

提出了符号对代码来防止符号对读取通道中的配对错误。研究具有最大可能最小符号对距离的符号对码具有重要意义，因为这种码具有最好的纠错能力。满足 Singleton 界限的符号对代码称为最大距离可分离 (MDS) 符号对代码。在本文中，利用具有奇特性的有限域上的重复根循环码，提出了两类新的MDS符号对码。应当注意，这些代码具有最小符号对距离十或十二。