A compact code or optimal prefix code minimizes the expected codeword length for the given source probabilities and coding alphabet. The relevant comparison here is among binary prefix codes. The minimum is also the minimum among uniquely decodable codes, since the Kraft-McMillan inequality permits every uniquely decodable length list to be realized by a prefix code with the same lengths.

Ancestors (13)

  1. iii
  2. a
  3. 2
  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