Title :
The complexity of minimum redundancy coding
Author :
Tjalkens, Tjalling
Author_Institution :
Eindhoven Univ. of Technol., Netherlands
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
Keywords :
Huffman codes; computational complexity; memoryless systems; redundancy; source coding; Huffman code; Shannon-Fano construction; binary symbols; complexity; complexity bottleneck; compression; minimum redundancy coding; source code; Costs; Decoding; Encoding; Indexing;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866671
