The complexity of minimum redundancy coding

T.J. Tjalkens

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

1 Citation (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages373-373
Number of pages1
ISBN (Print) 0-7803-5857-0
DOIs
Publication statusPublished - 2000
Eventconference; IEEE International Symposium on Information Theory; 2000-06-25; 2000-06-30 -
Duration: 25 Jun 200030 Jun 2000

Conference

Conferenceconference; IEEE International Symposium on Information Theory; 2000-06-25; 2000-06-30
Period25/06/0030/06/00
OtherIEEE International Symposium on Information Theory

Fingerprint

Dive into the research topics of 'The complexity of minimum redundancy coding'. Together they form a unique fingerprint.

Cite this