6 papers · 1 filter
Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound
Xiaoqiang Wang, Xun Song, Dabin Zheng +2
In spite of the intensive study of cyclic codes and the recent construction of an infinite family of self-dual binary cyclic codes whose minimum distances have the square-root boun…
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…
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…
Linear Codes from Projective Linear Anticodes Revisited
Hao Chen, Conghui Xie
An anticode with the diameter is a code in such that the distance between any two distinct codewords in is at most .…
Repeated-Root Cyclic Codes with Optimal Parameters or Best Parameters Known
Hao Chen, Conghui Xie, Cunsheng Ding
Cyclic codes are the most studied subclass of linear codes and widely used in data storage and communication systems. Many cyclic codes have optimal parameters or the best paramete…
Two classes of constacyclic codes with a square-root-like lower bound
Tingfang Chen, Zhonghua Sun, Conghui Xie +2
Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interestin…