b-symbol distance distribution of repeated-root cyclic codes

2017/04/11 by Hojjat Mostafanasab, Mostafanasab, Hojjat, Esra Şengelen Sevim +2
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.1704.03311

6 pages

arxiv created 2017/04/11 · openalex publication_date 2017/04/11 · arxiv updated 2017/04/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Symbol-pair codes, introduced by Cassuto and Blaum [1], have been raised for symbol-pair read channels. This new idea is motivated by the limitation of the reading process in high-density data storage technologies. Yaakobi et al. [8] introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b>2 symbols. In this paper, we come up with a method to compute the b-symbol-pair distance of two n-tuples, where n is a positive integer. Also, we deal with the b-symbol-pair distances of some kind of cyclic codes of length p^e over \mathbbF_p^m.

Related

• The symbol-pair distance distribution of repeated-root cyclic codes over \mathbbF_p^m
• Two classes of reducible cyclic codes with large minimum symbol-pair distances
• AMDS Symbol-Pair Codes from Repeated-Root Cyclic Codes
• Constacyclic symbol-pair codes: lower bounds and optimal constructions
• MDS Symbol-Pair Codes from Repeated-Root Cyclic Codes