Computer Science – Information Theory
Scientific paper
2005-06-10
Computer Science
Information Theory
5 pages, 3 figures. To be presented at the 2005 IEEE International Symposium on Information Theory
Scientific paper
In this paper we consider the use of variable length non prefix-free codes for coding constrained sequences of symbols. We suppose to have a Markov source where some state transitions are impossible, i.e. the stochastic matrix associated with the Markov chain has some null entries. We show that classic Kraft inequality is not a necessary condition, in general, for unique decodability under the above hypothesis and we propose a relaxed necessary inequality condition. This allows, in some cases, the use of non prefix-free codes that can give very good performance, both in terms of compression and computational efficiency. Some considerations are made on the relation between the proposed approach and other existing coding paradigms.
Dalai Marco
Leonardi Riccardo
No associations
LandOfFree
Non prefix-free codes for constrained sequences 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 Non prefix-free codes for constrained sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non prefix-free codes for constrained sequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-730160