Efficient construction of minimum-redundancy codes for large alphabets (Q4701144)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1365076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient construction of minimum-redundancy codes for large alphabets |
scientific article; zbMATH DE number 1365076 |
Statements
Efficient construction of minimum-redundancy codes for large alphabets (English)
0 references
21 November 1999
0 references
Huffman code
0 references
minimum-redundancy codes
0 references
prefix code
0 references
length-limited
0 references
0.8709136247634888
0 references
0.8590084314346313
0 references
0.8433219194412231
0 references
0.8369480967521667
0 references
