Three space-economical algorithms for calculating minimum-redundancy prefix codes (Q4544663)
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: Three space-economical algorithms for calculating minimum-redundancy prefix codes |
scientific article; zbMATH DE number 1775931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three space-economical algorithms for calculating minimum-redundancy prefix codes |
scientific article; zbMATH DE number 1775931 |
Statements
Three space-economical algorithms for calculating minimum-redundancy prefix codes (English)
0 references
4 August 2002
0 references
data compression
0 references
Huffman codes
0 references
large alphabets
0 references
lazy approach
0 references
minimum redundancy
0 references
prefix codes
0 references
algorithms
0 references
0.85999894
0 references
0.8573832
0 references
0.85555106
0 references
0.85083926
0 references
0.8463911
0 references
0.84533566
0 references
0.8441099
0 references
0.8413489
0 references
