Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences

@article{Drmota2011AnalysisOA,
  title={Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences},
  author={Michael Drmota and Wojciech Szpankowski},
  journal={2011 IEEE International Symposium on Information Theory Proceedings},
  year={2011},
  pages={1317-1321}
}
In 1993 Boncelet introduced a block arithmetic scheme for entropy coding that combines advantages of stream arithmetic coding with algorithmic simplicity. It is a variable-to-fixed length encoding in which the source sequence is partitioned into variable length phrases that are encoded by a fixed length dictionary pointer. The parsing is accomplished through a complete parsing tree whose leaves represent phrases. This tree, in its suboptimal heuristic version, is constructed by a simple divide… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

Tunstall Code

M. Drmota, Y. Reznik, W. Szpankowski
  • Khodak Variations, and Random Walks IEEE Trans. Information Theory , 56
  • 2010
VIEW 1 EXCERPT

Distribution of the number of factors in ran dom ordered factorizations of integers

H-K. Hwang
  • Journal of Number Theory,81, 61–92
  • 2000

Similar Papers

Loading similar papers…