A Generalization of the Tang-Ding Binary Cyclic Codes

2023/10/31 by Zhonghua Sun, Ling Li, Sun, Zhonghua +3 · 1 citation
Computer Science · Social Sciences · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Islamic Finance and Communication

paper · pdf · doi:10.48550/arxiv.2310.20179

openalex publication_date 2023/10/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Cyclic codes are an interesting family of linear codes since they have efficient decoding algorithms and contain optimal codes as subfamilies. Constructing infinite families of cyclic codes with good parameters is important in both theory and practice. Recently, Tang and Ding [IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842--7849, 2022] proposed an infinite family of binary cyclic codes with good parameters. Shi et al. [arXiv:2309.12003v1, 2023] developed the binary Tang-Ding codes to the 4-ary case. Inspired by these two works, we study 2^s-ary Tang-Ding codes, where s≥ 2. Good lower bounds on the minimum distance of the 2^s-ary Tang-Ding codes are presented. As a by-product, an infinite family of 2^s-ary duadic codes with a square-root like lower bound is presented.

Cited by

• Constacyclic codes with best-known parameters

Related

• A quaternary analogue of Tang-Ding codes
• Binary duadic codes and their related codes with a square-root-like lower bound
• Five infinite families of binary cyclic codes and their related codes with good parameters
• Parameters of several families of binary duadic codes and their related codes
• Binary [n,(n±1)/2] cyclic codes with good minimum distances from sequences