6 papers
A Criterion to Determine True Minimum Distances of Goppa Codes
Shuying Dong, Hao Chen, Yaqi Chen +2
Goppa codes play an important role in code-based cryptography due to their efficient decoding algorithms and their use as underlying private codes in the McEliece cryptosystem. To…
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…
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…
Concatenated Sum-Rank Codes
Huimin Lao, Hao Chen, San Ling +1
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebra…
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…