IEEE Transactions on Information Theory · 1997 · 66 citations · 8 references
EngineeringComputer ScienceAlgorithmsComputational LinguisticsInformation TheoryChannel CodingCoding TheoryError-correcting CodesSource CodingText EncodingAsymptotic PropertiesDictionary CodingFixed-length CodingVariable-length Coding
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.
8
An Introduction to Probability Theory and its Applications
Frank E. Grubbs · Technometrics · 1967 · 1.1K citations
Robert G. Gallager · Journal of the Operational Research Society · 1997 · 694 citations
Peter Eliaš · IEEE Transactions on Information Theory · 1955 · 449 citations