Name
Abstract | ||
|---|---|---|
A static Huffman code for a given source alphabet fa1 ; : : : ; an g is a prefix code generated by Huffman's algorithm. Such a code minimizes P n i=1 wi li among all prefix codes, where wi is the weight of ai and li is the number of bits used to encode ai . For data communication purposes, the initial parsing required by the static Huffman algorithm represents a big disadvantage. That happens because the data must be transmitted on-line. As soon as the symbol arrives to the transmitter, it must be encoded and transmitted to the receptor. For these situations, adaptive Huffman codes have been largely used. This method determines the mapping from symbol alphabets to codewords based upon a running estimate of the alphabet symbol weights. The code is adaptive, just changing to remain optimal for the current estimates. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1006/jagm.1999.1012 | Data Compression Conference |
Keywords | DocType | Volume |
big disadvantage,fgk algorithm,compression loss,data communication purpose,alphabet symbol weight,static huffman code,static huffman algorithm,adaptive huffman code,prefix code,source alphabet fa1,wi li,symbol alphabet,transmitters,algorithm design and analysis,huffman codes | Journal | 32 |
Issue | ISSN | ISBN |
2 | 0196-6774 | 0-7695-0096-X |
Citations | PageRank | References |
10 | 0.62 | 5 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruy Luiz Milidiú | 1 | 192 | 20.18 |
| Eduardo Sany Laber | 2 | 229 | 27.12 |
| Artur Alves Pessoa | 3 | 270 | 24.30 |
| MilidiúRuy Luiz | 4 | 10 | 0.62 |
| LaberEduardo Sany | 5 | 16 | 1.12 |
| PessoaArtur Alves | 6 | 10 | 0.62 |