4 papers · 1 filter
Optimal Codes with Positive Griesmer Defects, Related Optimal and Almost Optimal LRC Codes
Yurui Wang, Hao Chen, Xia Wu
Solomon and Stiffler constructed infinitely many families of linear codes meeting the Griesmer bound in 1965. It is well-known in 1990's that certain Griesmer codes (codes with the…
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…
New Euclidean and Hermitian Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances
Hao Chen
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to…
New Binary Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances
Hao Chen
The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 200…