On the analysis of variable-to-variable length codes
Conference Paper
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
The formula for the redundancy of large class of variable-to-variable length codes on discrete, memoryless sources was simplified. A variable-to-variable length code was decomposed into a parser and a string encoder. The asymptotic upper bounds on the redundancy of the 'Tunstall-Huffman' code and the 'Tunstall-Shannon-Fano' code were found.
name of conference
Proceedings IEEE International Symposium on Information Theory,