Variable to fixed-length codes for Markov sources

  title={Variable to fixed-length codes for Markov sources},
  author={Tjalling J. Tjalkens and Frans M. J. Willems},
  journal={IEEE Trans. Information Theory},
A&ract-Petry’s efficient and optimal variable to fixed-length source code for discrete memoryless sources was described by Scbalkwijk. By extending this coding technique we are able to give an algorithm for Markov sources that is easy to implement. We can bound the loss of efficiency as a function of the code complexity and the mismatch between the source and the code. Rates arbitrarily close to the source entropy are shown to be achievable. In this sense the codes introduced are optimal. 
Highly Cited
This paper has 69 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 33 extracted citations

Universal variable-to-fixed length source codes

IEEE Trans. Information Theory • 2001
View 4 Excerpts
Highly Influenced

Generalized Tunstall codes for sources with memory

IEEE Trans. Information Theory • 1997
View 4 Excerpts
Highly Influenced

On the coding rate of a multishot Tunstall code for stationary memoryless sources

2014 International Symposium on Information Theory and its Applications • 2014

Universal variable to fixed-length random number generators for finite memory sources

2013 IEEE International Symposium on Information Theory • 2013
View 2 Excerpts

69 Citations

Citations per Year
Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-5 of 5 references

The entropy of a rooted tree with probabilities,

J L. Massey
nresented at the IEEE Int. Svmn. Inform. Theorv. St. Jovite. Canada, Sept. 26-30,1983 • 1983

Generalized Kraft Inequality and Arithmetic Coding

IBM Journal of Research and Development • 1976

Information Theory and Reliable Communication

R. G. Gallager
New York: Wiley, • 1968

Probabilistic Information Theory

F. Jelinek
New York: McGraw-Hill, • 1968

Application of the Theory of Matrices

F. R. Gantmacher
New York: Interscience, • 1959

Similar Papers

Loading similar papers…