10 citations · 10 across the 10 of their papers we have counts for
11 papers
Generalized BCH Codes and Twisted Goppa Codes Attaining Their Designed Distances
Yaqi Chen, Hao Chen, Cunsheng Ding +3
Determining the true minimum distance of an alternant code remains a notoriously difficult problem in coding theory. In this paper, we study the minimum distances of generalized BC…
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…
On the Minimum Distances of Some Families of Goppa Codes and BCH Codes
Yaqi Chen, Hao Chen, Cunsheng Ding +1
Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Gop…
On the Minimum Distances of Some Families of BCH Codes
Yaqi Chen, Hao Chen, Cunsheng Ding +1
BCH codes form an important class of cyclic codes, which have applications in communication and data storage systems. Although the BCH bound provides a lower bound on the minimum d…
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…
Some constructions of non-generalized Reed-Solomon MDS Codes
Kanat Abdukhalikov, Cunsheng Ding, Gyanendra K. Verma
We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices fo…
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…
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…
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…
Cyclic and Negacyclic Sum-Rank Codes
Hao Chen, Cunsheng Ding, Zhiqiang Cheng +1
Sum-rank codes have known applications in the multishot network coding, the distributed storage and the construction of space-time codes. U. Mart\'ınez-Peñas introduced the cyclic-…
On the weight distributions of several classes of cyclic codes from APN monomials
Chunlei Li, Nian Li, Tor Helleseth +1
Let be an odd integer and be an odd prime. % with , where is an odd integer. In this paper, many classes of three-weight cyclic codes over $\mathbb{F}_{…