The problem of maximizing the n-letter mutual information of the trapdoor channel is considered. It is shown that 1over2 log2 (5over2) ≈ 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.
展开▼
