Recursive Bounds and Explicit Constructions for Error Coefficients of Optimal Linear Codes
IEEE Transactions on Information Theory · 2026-08 · 72 (8) · 5745-5758
DOI: 10.1109/tit.2026.3692559 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-08. Verfasst von Tingting Tong und 2 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Shandong Provincial Natural Science Foundation.
Abstract (Originalsprache)
The error coefficient of a linear code, defined as the number of minimum-weight codewords, plays a central role in evaluating the performance of the code. In this paper, we establish two recursive bounds on the minimum possible error coefficient among optimal linear codes with prescribed parameters. We prove that these bounds are tight in infinitely many cases by constructing two explicit infinite families of optimal linear codes that attain them with equality, and we further show that MDS codes also meet one of the proposed bounds with equality. Beyond the recursive-bound framework, we determine the minimum possible error coefficient for three explicit families of optimal linear codes: two families arising from simplex codes and one family associated with MacDonald codes. Moreover, employing tools from combinatorial design theory, we solve a problem proposed by (Guan et al., 2025) on the eventual constancy of the minimum error coefficient of optimal codes.
Förderung
- National Key Research and Development Program of China
- National Natural Science Foundation of China
- Shandong Provincial Natural Science Foundation
Zitieren
APA
Tong, T., Li, S., & Hu, S. (2026). Recursive Bounds and Explicit Constructions for Error Coefficients of Optimal Linear Codes. IEEE Transactions on Information Theory, 72(8), 5745-5758. https://doi.org/10.1109/tit.2026.3692559
Vancouver
Tong T, Li S, Hu S. Recursive Bounds and Explicit Constructions for Error Coefficients of Optimal Linear Codes. IEEE Transactions on Information Theory. 2026;72(8):5745-5758. doi:10.1109/tit.2026.3692559
BibTeX
@article{Tong2026,
author = {Tong, Tingting and Li, Shitao and Hu, Sihuang},
title = {Recursive Bounds and Explicit Constructions for Error Coefficients of Optimal Linear Codes},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {8},
pages = {5745--5758},
doi = {10.1109/tit.2026.3692559}
}
EUVIMED