Title :
Recursions for the trapdoor channel and an upper bound on its capacity
Author_Institution :
Inst. for Commun. Eng., Tech. Univ. Munchen, Munich, Germany
fDate :
June 29 2014-July 4 2014
Abstract :
The problem of maximizing the n-letter mutual information of the trapdoor channel is considered. It is shown that 1/2 log2 (5/2) ≈ 0.6610 bits per use is an upper bound on the capacity of the trapdoor channel. This upper bound, which is the tightest upper bound known, proves that feedback increases the capacity.
Keywords :
channel capacity; convex programming; convex optimization; feedback capacity; n-letter mutual information; trapdoor channel capacity recursion; upper bound recursion; Mutual information; Optimization; Probability distribution; Receivers; Upper bound; Vectors;
Conference_Titel :
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location :
Honolulu, HI
DOI :
10.1109/ISIT.2014.6875367
