Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum symbol-pair distance plays a vital role in determining the error-correcting capability and the constructions of symbol-pair codes with largest possible minimum symbol-pair distance is of great importance. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense that such codes can acheive the Singleton bound. In this paper, for length 5p, two new classes of MDS symbol-pair codes with minimum symbol-pair distance seven or eight are constructed by utilizing repeated-root cyclic codes over \({\mathbb {F}}_{p}\), where p is a prime. In addition, we derive a class of MDS symbol-pair codes with minimum symbol-pair distance seven and length 4p.

建议符号对代码以防止符号对读取通道中的对错误。最小符号对距离在确定纠错能力方面起着至关重要的作用，构建具有最大可能最小符号对距离的符号对码具有重要意义。最大距离可分离 (MDS) 符号对代码在这种代码可以实现单例界的意义上是最佳的。在本文中，对于长度为 5 p，利用\({\mathbb {F}}_{p} \)，其中p是素数。此外，我们导出了一类最小符号对距离为 7 且长度为 4 的 MDS 符号对码磷。