论文标题
来自重复根环代码的MDS符号对代码
MDS Symbol-Pair Codes from Repeated-Root Cyclic Codes
论文作者
论文摘要
提出了符号对代码以在符号对读取通道中对抗配对。最小符号对距离在确定符号对代码的错误校正功能方面具有重要意义。最大距离可分离（MDS）符号对代码是最佳的，从某种意义上说，此类代码可以实现单例绑定。在本文中，提出了两种新类的MDS符号代码，该代码利用具有奇数特征的有限字段，利用重复的root循环代码。确切地说，这些代码可能最小符号对距离十或十二，它比constacyclic代码中所有已知的MDS符号对代码大。
Symbol-pair codes are proposed to combat pair-errors in symbol-pair read channels. The minimum symbol-pair distance is of significance in determining the error-correcting capability of a symbol-pair code. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense that such codes can achieve the Singleton bound. In this paper, two new classes of MDS symbol-pair codes are proposed utilizing repeated-root cyclic codes over finite fields with odd characteristic. Precisely, these codes poss minimum symbol-pair distance ten or twelve, which is bigger than all the known MDS symbol-pair codes from constacyclic codes.
