abstract
- We analyze a generalization of Tunstall coding to sources with memory and demonstrate that this code becomes asymptotically optimal as the dictionary size increases.
Variable-to-fixed length codes for sources with memory
Conference Paper
- Overview
Overview
authors
published proceedings
- IEEE International Symposium on Information Theory - Proceedings
author list (cited authors)
- Savari, S. A., & Gallager, R. G.
complete list of authors
- Savari, SA||Gallager, RG
publication date
- December 1994