Ancestors (7)
- Optimal prefix code
- Huffman coding
- Information theory
- Probability and statistics
- Area of mathematics
- Mathematics
- Home
Incoming links (34)
- Binary translation of a quaternary prefix code
- Dyadic source matched to a complete prefix code
- Entropy bound for a random-length binary string
- Entropy rate and coding length
- Fano slice code redundancy bound
- Full-support probability distribution on a finite alphabet
- Huffman code
- Huffman coding
- Huffman sibling contraction
- Huffman sibling property
- Leaf depth in a code tree
- Nonunique optimal prefix code
- Optimality of a fixed-length code for a power-of-two alphabet
- Optimal prefix code
- Past exam of the communication Theory course of the University of Oxford / 2007 / 2 / b / Solution
- Past exam of the communication Theory course of the University of Oxford / 2009 / 2 / a / iii / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / a / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / iii / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / ii / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / i / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / b / iv / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / c / Solution
- Past exam of the information theory course of the University of Oxford / 2021 / 2 / d / Solution
- Past exam of the laser science and quantum information processing course of the University of Oxford / 2006 / 7 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 1 / f / Solution
- Past exam of the mathematics course of the University of Cambridge / 2021 / ii / Paper 1 / 11K / Solution
- Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 2 / 3I / a / ii / Solution
- Quaternary Huffman coding
- Redundancy of a binary prefix code
- Shape of minimum-cost positive-weight ternary prefix trees
- Ternary Huffman coding
- Ternary prefix code
- Trit
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.