Coding Theorem for Generalized Reed-Solomon Codes
IEEE Transactions on Information Theory · 2026-08 · 72 (8) · 5426-5441
DOI: 10.1109/tit.2026.3694362 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-08. Verfasst von Xiangping Zheng und 1 weiteren Autor:innen. Die Arbeit nennt 65 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Guangdong Provincial Key Laboratory of Information Security Technology.
Abstract (Originalsprache)
In this paper, we prove that the sub-field image of generalized Reed-Solomon (RS) code ensemble can achieve the symmetric capacity of $p$ -ary memoryless channels. Unlike the totally random linear code ensemble, as a class of maximum distance separable (MDS) codes, the generalized RS code ensemble lacks the pair-wise independence among codewords and has non-identical distributions of nonzero codewords. To prove the coding theorem for the $p$ -ary images of generalized RS code ensemble, we analyze the exponential upper bound on the error probability of the generalized RS code in terms of its spectrum using random coding techniques. In the finite-length region, we present an ML decoding algorithm for the generalized RS codes over the binary erasure channels (BECs). In particular, the algebraic structure of the generalized RS codes allows us to implement the parallel Lagrange interpolation to derive an ordered systematic matrix. Subsequently, we can reconstruct the ML codeword through a change of basis, accelerating the conventional Gaussian elimination (GE), as validated in the simulation results. Additionally, we apply this decoding technique to the ordered statistic decoding with local constraints (LC-OSD) algorithm over the additive white Gaussian noise (AWGN) channels with binary phase shift keying (BPSK) modulation and three-level pulse amplitude modulation (3PAM). Simulation results show that, in the high-rate region, generalized RS codes defined over fields of characteristic three with 3PAM perform better than those defined over fields of characteristic two with BPSK.
Förderung
- National Key Research and Development Program of China
- National Natural Science Foundation of China
- Guangdong Provincial Key Laboratory of Information Security Technology
Zitieren
APA
Zheng, X., & Ma, X. (2026). Coding Theorem for Generalized Reed-Solomon Codes. IEEE Transactions on Information Theory, 72(8), 5426-5441. https://doi.org/10.1109/tit.2026.3694362
Vancouver
Zheng X, Ma X. Coding Theorem for Generalized Reed-Solomon Codes. IEEE Transactions on Information Theory. 2026;72(8):5426-5441. doi:10.1109/tit.2026.3694362
BibTeX
@article{Zheng2026,
author = {Zheng, Xiangping and Ma, Xiao},
title = {Coding Theorem for Generalized Reed-Solomon Codes},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {8},
pages = {5426--5441},
doi = {10.1109/tit.2026.3694362}
}
EUVIMED