The chain rule for entropy, with placed last, gives
(1)
Since includes all the preceding coordinates, conditioning monotonicity gives
(2)
This proves the first assertion for every , including . Sum over : the conditional terms on the right sum to by the ordinary chain rule. Thus
(3)
This is Han's entropy inequality.

Ancestors (13)

  1. ii
  2. b
  3. 1
  4. 2009
  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