A new class of AMDS symbol-pair codes from repeated-root codes

Symbol-pair codes can be applied to protect against the pair errors in symbol-pair read channels. Constructing symbol-pair codes with good parameters has become a main problem in the study of pair-error correction. In this paper, we give a new class of almost maximum distance separable (AMDS) symbol-pair codes with length $ 8p $ through repeated-root cyclic codes, where $ p\equiv1({\rm{mod}}~~ \; 8) $. The results are obtained by analyzing the solutions of certain equations over finite fields.