Is Huffman coding dead?

Abraham Bookstein, Shmuel T. Klein, Timo Raita

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

We discuss several situations in which, in spite of the optimality of arithmetic codes, Huffman codes may be preferable. We therefore suggest that the question raised in the title should be answered negatively.

Original languageEnglish
Title of host publicationProceedings of the Annual International ACM SIGIR Conference on Research and Development in Infofmation Retrieval
PublisherPubl by ACM
Pages80-87
Number of pages8
ISBN (Print)0897916050
StatePublished - 1993
Externally publishedYes
EventProceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval - Pittsburgh, PA, USA
Duration: 27 Jun 19931 Jul 1993

Publication series

NameProceedings of the Annual International ACM SIGIR Conference on Research and Development in Infofmation Retrieval

Conference

ConferenceProceedings of the 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
CityPittsburgh, PA, USA
Period27/06/931/07/93

Fingerprint

Dive into the research topics of 'Is Huffman coding dead?'. Together they form a unique fingerprint.

Cite this