loading
On Context—Tree Prediction of Individual Sequences
2006 Edition, January 1, 2006 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Motivated by the evident success of context-tree based methods in lossless data compression, we explore, in this paper, methods of the same spirit in universal prediction of individual sequences. By context-tree...

On Context-Tree Prediction of Individual Sequences
2007 Edition, Volume 53, May 1, 2007 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Motivated by the evident success of context-tree based methods in lossless data compression, we explore, in this correspondence, methods of the same spirit in universal prediction of individual sequences. By context-tree...

Individual Sequence Prediction Using Memory-Efficient Context Trees
2009 Edition, Volume 55, November 1, 2009 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for the task of individual sequence prediction. Our...

Memoryless individual sequences
2004 Edition, January 1, 2004 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

We establish that memoryless individual sequences share a number of properties with stochastic sequences. The first is an elementary law of large numbers and the second shows that memoryless binary sequences have weakly convergent empirical distributions...

Coding theorems for individual sequences
1978 Edition, Volume 24, July 1, 1978 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A quantity called the {\em finite-state} complexity is assigned to every infinite sequence of elements drawn from a finite sot. This quantity characterizes the largest compression ratio that can be achieved in accurate transmission of the sequence by any finite-state...

Universal prediction of individual sequences
1991 Edition, January 1, 1991 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The problem of sequentially determining the next, future, outcome of a specific binary individual sequence, based on its observed past, using a finite state predictor is considered. The authors define the finite state predictability of the (infinite)...

Universal prediction of individual sequences
1992 Edition, Volume 38, July 1, 1992 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The problem of predicting the next outcome of an individual binary sequence using finite memory is considered. The finite-state predictability of an infinite sequence is defined as the minimum fraction of prediction errors that can be made by...

Perfectly Secure Encryption of Individual Sequences
2013 Edition, Volume 59, March 1, 2013 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In analogy to the well-known notion of finite-state compressibility of individual sequences, due to Lempel and Ziv, we define a similar notion of "finite-state encryptability" of an individual plain-text sequence, as the minimum asymptotic key...

Finite-state rate-distortion for individual sequences
2004 Edition, January 1, 2004 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

We introduce a class of lossy finite-state machines for lossy compression of an individual sequence drawn from a finite alphabet at a fixed distortion, and define a fundamental quantity finite-state rate-distortion that is an asymptotically attainable lower bound...

Perfectly secure encryption of individual sequences
2012 Edition, July 1, 2012 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In analogy to the well-known notion of finite-state compressibility of individual sequences, due to Lempel and Ziv, we define a similar notion of "finite-state encryptability" of an individual plaintext sequence, as the minimum asymptotic key...

Advertisement