Algorithmic computability and approximability of capacity-achieving input distributions
From MaRDI portal
Publication:6574826
DOI10.1109/tit.2023.3278705zbMath1547.9426MaRDI QIDQ6574826
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)
algorithmsTuring machineschannel capacityimpossibilitydiscrete memoryless channelscapacity-achieving input distributioncomputation of optimal input distribution
Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)
This page was built for publication: Algorithmic computability and approximability of capacity-achieving input distributions