Optimal prefix codes with fewer distinct codeword lengths are faster to construct (Q2272991)
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: Optimal prefix codes with fewer distinct codeword lengths are faster to construct |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal prefix codes with fewer distinct codeword lengths are faster to construct |
scientific article |
Statements
Optimal prefix codes with fewer distinct codeword lengths are faster to construct (English)
0 references
17 September 2019
0 references
data structures
0 references
optimal prefix codes
0 references
Huffman trees
0 references
median finding
0 references
output-sensitive
0 references
0.9249497652053832
0 references
0.8369480967521667
0 references
0.827857255935669
0 references
0.8256860971450806
0 references
0.8255948424339294
0 references
