For every input probability mass function, conditional entropy is nonnegative, so
(1)
Taking the maximum over input laws proves bit per channel use. This bound comes from the binary input alphabet itself; no specific transition probabilities or decoder are needed.

Ancestors (11)

  1. 3
  2. 2021
  3. Past exam of the information theory course of the University of Oxford
  4. Information theory course of the University of Oxford
  5. Year 3 of the mathematics course of the University of Oxford
  6. Mathematics course of the University of Oxford
  7. Undergraduate course of the University of Oxford
  8. Course of the University of Oxford
  9. University of Oxford
  10. List of universities
  11. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version