The binary entropy is
(1)
The Shannon source coding theorem requires
(2)
for the standard Shannon construction, while every prefix code obeys the lower bound. Numerically,
(3)
Thus both codes satisfy the theorem, with the Huffman code closer to the entropy lower bound.

Ancestors (12)

  1. iii
  2. b
  3. 3I
  4. Paper 1
  5. ii
  6. 2020
  7. Past exam of the mathematics course of the University of Cambridge
  8. Mathematics course of the University of Cambridge
  9. Course of the University of Cambridge
  10. University of Cambridge
  11. List of universities
  12. 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