Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
IEEE Transactions on Information Theory · 2026-08 · 72 (8) · 5501-5515
DOI: 10.1109/tit.2026.3702908 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-08. Verfasst von Jonathan Mosheiff und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 61 Literaturangaben. Gefördert von: Israel Science Foundation, Alon Fellowship, Veni Grant from the Dutch Research Council [Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)].
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Israel Science Foundation
- Alon Fellowship
- Veni Grant from the Dutch Research Council [Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)]
- National Key Research and Development Program of China
- National Natural Science Foundation of China
Zitieren
APA
Mosheiff, J., Resch, N., Shang, K., & Yuan, C. (2026). Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. IEEE Transactions on Information Theory, 72(8), 5501-5515. https://doi.org/10.1109/tit.2026.3702908
Vancouver
Mosheiff J, Resch N, Shang K, Yuan C. Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. IEEE Transactions on Information Theory. 2026;72(8):5501-5515. doi:10.1109/tit.2026.3702908
BibTeX
@article{Mosheiff2026,
author = {Mosheiff, Jonathan and Resch, Nicolas and Shang, Kuo and Yuan, Chen},
title = {Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {8},
pages = {5501--5515},
doi = {10.1109/tit.2026.3702908}
}
EUVIMED