Algorithmic computability and approximability of capacity-achieving input distributions

DOI10.1109/TIT.2023.3278705MaRDI QIDQ6574826zbMATH OpenFDO

Authors Holger Boche, Rafael F. Schaefer, H. Vincent Poor

Publication date 19 July 2024

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

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

zbMATH Keywords

algorithmscapacity-achieving input distributionchannel capacitycomputation of optimal input distributiondiscrete memoryless channelsimpossibilityTuring machines

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(3)

• Computability of classification and deep learning: from theoretical limits to practical feasibility through quantization
• Minimal trellises for non-degenerate and degenerate decoding of quantum stabilizer codes
• On effective convergence in Fekete's lemma and related combinatorial problems in information theory

This page was built for publication: Algorithmic computability and approximability of capacity-achieving input distributions

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