4 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…
-Fold -Blocking Sets and -Minimal Codes
Hao Chen, Xu Pan, Conghui Xie
Blocking sets and minimal codes have been studied for many years in projective geometry and coding theory. In this paper, we provide a new lower bound on the size of -fold -b…
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…
Minimal Linear Codes Violating the Ashikhmin-Barg Condition from Arbitrary Projective Linear Codes
Hao Chen, Yaqi Chen, Conghui Xie +1
In recent years, there have been many constructions of minimal linear codes violating the Ashikhmin-Barg condition from Boolean functions, linear codes with few nonzero weights or…