What people are saying - Write a review
We haven't found any reviews in the usual places.
Heuristic Introduction to the Discrete Memoryless Channel
The Discrete FiniteMemory Channel
3 other sections not shown
Other editions - View all
apply arbitrary argument asymptotic equipartition property binary symmetric channel Borel set capacity Cartesian product channel of Section channel sequence Chapter Chebyshev's inequality code n coding theorem components compound channel concave function conditional entropy corresponding cylinder set decoding defined denote depend disjoint disjoint sets duration of memory entropy ergodic exists a code exp2 finite function Hence information digits input alphabet integer jr-sequence knows the c.p.f. left member length Let u0 Markov chain matrix memoryless channel notation number of elements obtain obviously output alphabet past history present section probability distribution probability of error proof of Theorem prove Theorem proves Lemma proves the theorem real w-sequence received letters received sequence result right member satisfies Section 5.1 sender and receiver sent standard chance variables stochastic input stochastic matrix strong converse subcode sufficiently large sw-input upper bound vector w-sequence u0 weak converse word