The Context-Tree Weighting Method : Extensions

@article{Willems1998TheCW,
  title={The Context-Tree Weighting Method : Extensions},
  author={Frans M. J. Willems},
  journal={IEEE Trans. Information Theory},
  year={1998},
  volume={44},
  pages={792-798}
}
First we modify the basic (binary) context-tree weighting method such that the past symbolsx1 D; x2 D; ; x0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depthD infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T 1: Here T is the length of the source sequence. For this extended context-tree weighting algorithm we show that with probability one the… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 180 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

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

180 Citations

01020'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 180 citations based on the available data.

See our FAQ for additional information.

References

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

Context tree weighting: Basic properties

  • IEEE Trans. Inform. Theory, vol. 41, pp. 653–664…
  • 1995

Context tree weighting: A sequential universal source coding procedure for FSMX sources

  • F.M.J. Willems, Y. M. Shtarkov, T. J. Tjalkens
  • inProc. IEEE Int. Symp. Information Theory (San…
  • 1993

The performance of universal encoding

  • V. K. Trofimov
  • IEEE Trans . Inform . Theory
  • 1981

Combinatorial method of universal coding for discrete stationary sources

  • Y. M. Shtarkov, V. F. Babkin
  • Proc. 2nd Int. Symp. Information Theory…
  • 1971

Similar Papers

Loading similar papers…