2020/10/09 by Junru Ma, Ma, Junru, Jinquan Luo +1 · 4 citations
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.2010.04329
openalex publication_date 2020/10/09 · arxiv created 2022/06/20 · arxiv updated 2022/06/22 · openalex created_date 2023/02/14 · openalex updated_date 2026/07/28
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 \mathbbFp, 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.