2 papers
cs.IT2026
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…
cs.IT2026
Strong Singleton-Like Bounds, Quasi-Perfect Codes and Distance-Optimal Codes in the Sum-Rank Metric
Chao Liu, Hao Chen, Qinqin Ji +3
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distrib…