Variable-to-fixed length codes for sources with memory
Conference Paper
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
We analyze a generalization of Tunstall (1968) coding to sources with memory and demonstrate that this code becomes asymptotically optimal as the dictionary size increases. 1994 IEEE.
name of conference
Proceedings of 1994 IEEE International Symposium on Information Theory