The length of a typical Huffman codeword
| dc.creator | Schack, R. | |
| dc.date | 1993-03-05 | |
| dc.date.accessioned | 2026-07-07T09:05:26Z | |
| dc.date.available | 2026-07-07T09:05:26Z | |
| dc.description | If p is the probability of a letter of a memoryless source, the length l of the corresponding binary Huffman codeword can be very different from the value -log p. We show that, nevertheless, for a typical letter, l is approximately equal to -log p. More precisely, the probability that l differs from -log p by more than m decreases exponentially with m. | |
| dc.description | 4 pages, LATEX | |
| dc.identifier | https://arxiv.org/abs/adap-org/9303001 | |
| dc.identifier | http://arxiv.org/abs/adap-org/9303001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/149677 | |
| dc.subject | Adaptation and Self-Organizing Systems | |
| dc.title | The length of a typical Huffman codeword | |
| dc.type | text |