MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The idea of Typical sequences( is a crucial concept in Shannon's proof of the Noisy channel coding theorem. Unfortunately the notion is not sufficient to settle the capacity of transmission of non-communicating correlated sources over independent channels to a common noisy receiver? Even the problem of two-user interference channel capacity with uncorrelated sources is open. What makes it hard to apply typicality to these cases?

Is it possible to associate a geometry/topology to easily visualize typical sequences(atleast when the alphabets are $1$-dimensional reals - more complicated cases include matrix or non-commutatitve alphabets such as in Multiple Input and Multiple Output systems)? Shannon's proof( is geometry-less and very abstract.

share|cite|improve this question

yes,there is an illustrative proof here : Network information theory by Abbas El gammal and

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.