Generalized Huffman coding for binary trees with choosable edge lengths (Q2512825)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized Huffman coding for binary trees with choosable edge lengths |
scientific article |
Statements
Generalized Huffman coding for binary trees with choosable edge lengths (English)
0 references
30 January 2015
0 references
combinatorial problems
0 references
binary tree
0 references
Kraft's inequality
0 references
Huffman coding
0 references
choosable edge lengths
0 references
0 references
0 references
