Tjalling J. Tjalkens

Learn More
We describe a sequential universal data compression procedure for binary tree sources that performs the “double mixture.” Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and(More)
The sequential Context Tree Weighting procedure [6] achieves the asymptotically optimal redundancy behavior of k/2 · (log n)/n, where k is the number of free parameters of the source and n is the sequence length. For FSMX sources with an alphabet A, this number, k, is (|A| − 1) · |Ka|. However, especially the FSMX sources often use only a few possible(More)
Two low-complexity methods are proposed for sequential probability assignment for binary independent and identically distributed (i.i.d.) individual sequences with empirical distributions whose governing parameters are known to be bounded within a limited interval. The methods can be applied to different problems where fast accurate estimation of the(More)
Copyright c ©1997 IEEE. Reprinted from IEEE Information Theory Society Newsletter, Vol. 47, No. 1, March 1997. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works(More)
TABLE I EXAMPLE CODEWORDS AND Q‘, Q2, AND Q3 [7] P. Delsarte and P. Piret, “Algebraic constructions of Shannon codes for regular channels,” IEEE Trans. Inform. Theory, vol. IT-28, no. 4, pp. 593-599. Q’ Q2 Q 3 [8] R. G. Gallager, Information Theory and Reliable Communication. New York Wiley, 1968. [9] W. W. Peterson and E. J. Weldon, Jr., Error-Correcting(More)