Computer Science – Information Theory
Scientific paper
2008-09-05
Computer Science
Information Theory
5 pages, 5 figures, accepted to ISIT 2009
Scientific paper
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, including Markov sources, which require a (suboptimal) generalization of Tunstall's algorithm proposed by Savari and analytically examined by Tabus and Rissanen. In general, if n is the total number of output leaves across all Tunstall trees, s is the number of trees (states), and D is the number of leaves of each internal node, then this method takes O((1+(log s)/D) n) time and O(n) space.
No associations
LandOfFree
Efficient Implementation of the Generalized Tunstall Code Generation Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient Implementation of the Generalized Tunstall Code Generation Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Implementation of the Generalized Tunstall Code Generation Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-658586