6 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…
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…
On optimal quantum LRCs from the Hermitian construction and -designs
Yang Li, Shitao Li, Huimin Lao +2
In a recent work, quantum locally recoverable codes (qLRCs) have been introduced for their potential application in large-scale quantum data storage and implication for quantum LDP…
Properties and Decoding of Twisted GRS Codes and Their Extensions
Yang Li, Martianus Frederic Ezerman, Huimin Lao +1
Maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes are called non-GRS MDS codes. Alongside near MDS (NMDS) codes, they are appli…