Computing the Channel Capacity of a Communication System Affected by Uncertain Transition Probabilities

DOI10.1109/TIT.2018.2821674MaRDI QIDQ4682953zbMATH OpenFDO

Authors Krzysztof Postek, Aharon Ben-Tal

Publication date 19 September 2018

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

Full work available at URL https://arxiv.org/abs/1706.05889

Mathematics Subject Classification ID

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

Abstract: We study the problem of computing the capacity of a discrete memoryless channel under uncertainty affecting the channel law matrix, and possibly with a constraint on the average cost of the input distribution. The problem has been formulated in the literature as a max-min problem. We use the robust optimization methodology to convert the max-min problem to a standard convex optimization problem. For small-sized problems, and for many types of uncertainty, such a problem can be solved in principle using interior point methods (IPM). However, for large-scale problems, IPM are not practical. Here, we suggest an $mathcalO(1/T)$ first-order algorithm based on Nemirovski (2004) which is applied directly to the max-min problem.

This page was built for publication: Computing the Channel Capacity of a Communication System Affected by Uncertain Transition Probabilities

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