Every row has Shannon entropy , so for every input law. Since the output alphabet has three symbols, Gibbs inequality gives . The uniform input gives
(1)
so it attains the upper bound. Therefore
(2)
Uniform output is necessary for equality in the entropy bound, and the three displayed equations then force the uniform input, so this optimum input law is unique.

Ancestors (13)

  1. ii
  2. c
  3. 3
  4. 2010
  5. Past exam of the communication Theory course of the University of Oxford
  6. Communication Theory course of the University of Oxford
  7. Year 3 of the mathematics course of the University of Oxford
  8. Mathematics course of the University of Oxford
  9. Undergraduate course of the University of Oxford
  10. Course of the University of Oxford
  11. University of Oxford
  12. List of universities
  13. 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