The symbol-pair distance distribution of repeated-root cyclic codes over \mathbbF_p^m

2016/07/07 by Shixin Zhu, Zhonghua Sun, Zhu, Shixin +3
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT

paper · pdf · doi:10.48550/arxiv.1607.01887

arxiv created 2016/07/07 · openalex publication_date 2016/07/07 · arxiv updated 2016/07/08 · openalex created_date 2016/09/16 · openalex updated_date 2026/07/28

Abstract

Symbol-pair codes are proposed to protect against pair errors in symbol-pair read channels. One of the most important task in symbol-pair coding theory is to determine the minimum pair-distance of symbol-pair codes. In this paper, we investigate the symbol-pair distances of cyclic codes of length p^e over \mathbbF_p^m. The exact symbol-pair distances of all cyclic codes of such length are determined.

Citations

• Constacyclic symbol-pair codes: lower bounds and optimal constructions

Related

• b-symbol distance distribution of repeated-root cyclic codes
• AMDS Symbol-Pair Codes from Repeated-Root Cyclic Codes
• Two classes of reducible cyclic codes with large minimum symbol-pair distances
• MDS Symbol-Pair Codes from Repeated-Root Cyclic Codes
• Constructions of MDS symbol-pair codes with minimum distance seven or eight