A fast algorithm for optimal length-limited Huffman codes (Q3477965)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:3477965 |
scientific article; zbMATH DE number 4147517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for optimal length-limited Huffman codes |
scientific article; zbMATH DE number 4147517 |
Statements
A fast algorithm for optimal length-limited Huffman codes (English)
0 references
1990
0 references
binary tree
0 references
Huffman coding
0 references
coding and information theory
0 references
data
0 references
compaction and compression
0 references
0.8545226454734802
0 references
0.8476693630218506
0 references
0.8476693630218506
0 references
0.8280273675918579
0 references
0.8255948424339294
0 references
