Generalized Tunstall codes for sources with memory Academic Article

abstract

• Tunstall codes are variable-to-fixed length codes that maximize the expected number of source letters per dictionary string for discrete, memoryless sources. We analyze a generalization of Tunstall coding to sources with memory and demonstrate that as the dictionary size increases, the number of code letters per source symbol comes arbitrarily close to the minimum among all variable-to-fixed length codes of the same size. We also find the asymptotic relationship between the dictionary size and the average length of a dictionary entry. 1997 IEEE.

authors

• Savari, Serap

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

altmetric score

• 3

author list (cited authors)

• Savari, S. A., & Gallager, R. G.

citation count

• 38

complete list of authors

• Savari, SA||Gallager, RG

publication date

• March 1997

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Sources With Memory
• Tunstall Codes
• Variable-to-fixed Length Codes

Digital Object Identifier (DOI)

• 10.1109/18.556121

start page

• 658

end page

• 668

volume

• 43

issue

• 2

URL

• http://dx.doi.org/10.1109/18.556121