The binary Kraft inequality states that codeword lengths of a prefix code, or more generally a uniquely decodable code, satisfy
(1)
Conversely, positive integer lengths obeying this inequality can be realized by a binary prefix code.

Ancestors (10)

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