Samenvatting
An efficient implementation of a Huffman code is based on the Shannon-Fano construction. An important question is: how complex is such an implementation? In the past authors have considered this question assuming an ordered source symbol alphabet. For of the compression of blocks of binary symbols this ordering must be performed explicitly and it turns out to be the complexity bottleneck.
Originele taal-2 | Engels |
---|---|
Titel | Proceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy |
Plaats van productie | Piscataway |
Uitgeverij | Institute of Electrical and Electronics Engineers |
Pagina's | 373-373 |
Aantal pagina's | 1 |
ISBN van geprinte versie | 0-7803-5857-0 |
DOI's | |
Status | Gepubliceerd - 2000 |
Evenement | 2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, Verenigde Staten van Amerika Duur: 9 jul. 2006 → 14 jul. 2006 |
Congres
Congres | 2006 IEEE International Symposium on Information Theory, ISIT 2006 |
---|---|
Verkorte titel | ISIT 2006 |
Land/Regio | Verenigde Staten van Amerika |
Stad | Seattle |
Periode | 9/07/06 → 14/07/06 |
Ander | Int. Symp. on Information Theory ISIT 2006, Seattle, USA |