A binary prefix code assigns each source symbol a distinct finite binary word, with no assigned word a prefix of another. It is instantaneous because a decoder can identify the symbol as soon as its last digit arrives, without reading digits from the next word. Such a code is optimal when it minimizes
(1)
among all binary prefix codes for that source distribution. Symbols of zero probability may be removed from the optimization.

Ancestors (13)

  1. i
  2. a
  3. 4
  4. 2008
  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