arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.20179cs.ITmath.IT
收藏

Tang-Ding二元循环码的推广

A Generalization of the Tang-Ding Binary Cyclic Codes

Zhonghua Sun, Ling Li, Shixin Zhu

AI总结:

本文将Tang-Ding二元循环码推广到2^s元情形,给出了其最小距离的良好下界,并构造出具有类平方根下界的无限2^s元duadic码族。

摘要:

循环码是一类有趣的线性码,因为它们具有高效的译码算法,并且包含最优码作为子族。构造具有良好参数的无限循环码族在理论和实践中都很重要。最近,Tang和Ding [IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842--7849, 2022] 提出了一个具有良好参数的无限二元循环码族。Shi等人 [arXiv:2309.12003v1, 2023] 将二元Tang-Ding码发展到了4元情形。受这两项工作的启发,我们研究了2^s元Tang-Ding码,其中s≥2。给出了2^s元Tang-Ding码最小距离的良好下界。作为附带成果,提出了一个具有类平方根下界的无限2^s元duadic码族。

英文摘要:

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\geq 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑