3 papers
cs.IT2026
Constructing Good Abelian Codes via Shift Bounds and Genetic Algorithms
Cong Yu, Hao Chen, Zhonghua Sun +1
This paper investigates the construction of linear codes via abelian codes over finite fields. By exploiting the algebraic structure of multivariate polynomial quotient rings, we d…
cs.IT2025
Infinitely many families of distance-optimal binary linear codes with respect to the sphere packing bound
Hao Chen, Conghui Xie, Cunsheng Ding
R. W. Hamming published the Hamming codes and the sphere packing bound in 1950. In the past 75 years, infinite families of distance-optimal linear codes over finite fields with min…
cs.IT2024
Self-Dual Cyclic Codes with Square-Root-Like Lower Bounds on Their Minimum Distances
Hao Chen, Cunsheng Ding
Binary self-dual cyclic codes have been studied since the classical work of Sloane and Thompson published in IEEE Trans. Inf. Theory, vol. 29, 1983. Twenty five years later, an inf…