A generalization of Huffman coding for messages with frequencies given by upper and lower bounds (Corresp.).
S. SmithPublished in: IEEE Trans. Inf. Theory (1974)
Keyphrases
- upper and lower bounds
- huffman coding
- data compression
- upper bound
- run length coding
- compression ratio
- lower bound
- lower and upper bounds
- image compression
- entropy coding
- compression scheme
- arithmetic coding
- image quality
- compression algorithm
- multiresolution
- sample complexity
- compressed data
- model selection
- sample size
- data structure
- small number