#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1987

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Frans M. J. Willems, Yuri M. Shtarkov, Tjalling J. Tjalkens
- IEEE Trans. Information Theory
- 1995

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 eecient 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)

- Frans M. J. Willems, Yuri M. Shtarkov, Tjalling J. Tjalkens
- IEEE Trans. Information Theory
- 1996

Context weighting procedures are presented for sources with models (structures) in four diierent classes. Although the procedures are designed for universal data compression purposes, their generality allows application in the area of classiication.

- Tjalling J. Tjalkens, Frans M. J. Willems
- IEEE Trans. Information Theory
- 1987

- Tjalling J. Tjalkens, Frans M. J. Willems
- IEEE Trans. Information Theory
- 1992

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 for resale or redistribution must be obtained from the IEEE by sending a blank email message to… (More)

We present a method to decrease the storage and communication complexity of the context-tree weighting method. This method is based on combining the estimated probability of a node in the context tree and weighted probabilities of its children in one single variable. This variable is represented by its logarithm.

The context-tree weighting algorithm 6] is an eecient universal source coding method for tree sources. Although a nite accuracy version of this algorithm has been analysed in 8], it is better to implement the algorithm as proposed in 7]. There it was suggested to store in each node s of the context tree, instead of an estimated probability P s e and a… (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) · |K a |. However, especially the FSMX sources often use only a few possible… (More)

- Tjalling J. Tjalkens
- IEEE Trans. Information Theory
- 1994

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)

— The context-tree weighting method (Willems, Shtarkov, and Tjalkens [1995]) is a sequential universal source coding method that achieves the Rissanen lower bound [1984] for tree sources. The same authors also proposed context-tree maximizing, a two-pass version of the context-tree weighting method [1993]. Later Willems and Tjalkens [1998] described a… (More)