Efficient variants of Huffman codes in high level languages

Y. Choueka, S. T. Klein, Y. Perl

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Scopus citations

Abstract

Although it is well-known that Huffman Codes are optimal for text compression in a character-per-chaxacter encoding scheme, they are seldom used in practical situations since they reqnire a bit-per-bit decoding algorithm, which has to be written is some assembly langnage, and will perform rather slowly. A number of methods are presented that avoid these difficulties. The decoding algorithms efficiently process the encoded string on a byte-per-byte basis, are faster than the original algorithm, and can be programmed in any high level langnage. This is achieved at the cost of storing some tables in the internal memory, but with no loss in the compression savings of the optimal Huffman codes. The internal memory space needed can be reduced either at the cost of increased processing time, or by using non-binary Huffman codes, which give sub-optimal compression. Experimental results for English and Hebrew text are also presented.

Original languageEnglish (US)
Title of host publicationProceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1985
PublisherAssociation for Computing Machinery, Inc
Pages122-130
Number of pages9
ISBN (Electronic)0897911598, 9780897911597
DOIs
StatePublished - Jun 5 1985
Externally publishedYes
Event8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1985 - Montreal, Canada
Duration: Jun 5 1985Jun 7 1985

Publication series

NameProceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1985

Other

Other8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1985
CountryCanada
CityMontreal
Period6/5/856/7/85

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems

Fingerprint Dive into the research topics of 'Efficient variants of Huffman codes in high level languages'. Together they form a unique fingerprint.

Cite this