Randomness-efficient constructions of capacity-achieving list-decodable codes

DOI10.1109/TIT.2026.3702908MaRDI QIDQ7412033zbMATH OpenFDO

Authors Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan

Publication date 2026

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2026.3702908

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

This page was built for publication: Randomness-efficient constructions of capacity-achieving list-decodable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7412033)