Jacob Ziv

IEEE Trans. Inf. Theory, 2021

2015

A constrained-dictionary version of LZ78 asymptotically achieves the finite-state compressibility with a distortion measure.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014

A Constrained-Dictionary version of LZ78 asymptotically achieves the Finite-State Compressibility for any Individual Sequence.

[BibT_eX]

[DOI]

CoRR, 2014

2011

An Axiomatic Approach to the Notion of Similarity of Individual Sequences and Their Classification.

[BibT_eX]

[DOI]

Proceedings of the First International Conference on Data Compression, 2011

2009

The universal LZ77 compression algorithm is essentially optimal for individual finite-length N-blocks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

On the optimality of universal classifiers for finite-length individual test sequences

[BibT_eX]

[DOI]

CoRR, 2009

2008

On Finite Memory Universal Data Compression and Classification of Individual Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

2007

On Context-Tree Prediction of Individual Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Classification With Finite Memory Revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Constrained Information Combining: Theory and Applications for LDPC Coded Systems.

[BibT_eX]

[DOI]

Ilan Sutskover

Shlomo Shamai

IEEE Trans. Inf. Theory, 2007

2006

On the Wyner-Ziv problem for individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On Limited Memory Universal Classification of Individual Sequences.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Extremes of information combining.

[BibT_eX]

[DOI]

Ilan Sutskover

Shlomo Shamai

IEEE Trans. Inf. Theory, 2005

2004

Correction to: "An Efficient Universal Prediction Algorithm for Unknown Sources With Limited Training Data".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

2002

An efficient universal prediction algorithm for unknown sources with limited training data.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Shannon theory: Perspective, trends, and applications special issue dedicated to Aaron D. Wyner.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

2001

A universal prediction lemma and applications to universal data compression and prediction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

2000

On the temporal HZY compression scheme.

[BibT_eX]

[DOI]

Z. Cohen

Yossi Matias

S. Muthukrishnan

Süleyman Cenk Sahinalp

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

On the decoding of convolutional codes on an unknown channel.

[BibT_eX]

[DOI]

Amos Lapidoth

IEEE Trans. Inf. Theory, 1999

1998

On the Role of Pattern Matching in Information Theory.

[BibT_eX]

[DOI]

Abraham J. Wyner

IEEE Trans. Inf. Theory, 1998

On the Universality of the LZ-Based Decoding Algorithm.

[BibT_eX]

[DOI]

Amos Lapidoth

IEEE Trans. Inf. Theory, 1998

On Sliding-Window Universal Data Compression with Limited Memory.

[BibT_eX]

[DOI]

Yehuda Hershkovits

IEEE Trans. Inf. Theory, 1998

Augmenting Suffix Trees, with Applications.

[BibT_eX]

[DOI]

Yossi Matias

S. Muthukrishnan

Süleyman Cenk Sahinalp

Proceedings of the Algorithms, 1998

1997

On the amount of statistical side information required for lossy data compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

On fixed-database universal data compression with limited memory.

[BibT_eX]

[DOI]

Yehuda Hershkovits

IEEE Trans. Inf. Theory, 1997

1996

Classification with finite memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Universal delay estimation for discrete channels.

[BibT_eX]

[DOI]

J. J. Stein

IEEE Trans. Inf. Theory, 1996

1995

On Encoding and Decoding with Two-Way Head Machines

[BibT_eX]

[DOI]

Dafna Sheinwald

Inf. Comput., January, 1995

On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence.

[BibT_eX]

[DOI]

Martin Farach

Michiel O. Noordewier

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

The sliding-window Lempel-Ziv algorithm is asymptotically optimal.

[BibT_eX]

[DOI]

Proc. IEEE, 1994

On Universal Data Compression - An Intuitive Overview.

[BibT_eX]

[DOI]

J. Vis. Commun. Image Represent., 1994

1993

A measure of relative entropy between individual sequences with application to universal classification.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Correction to 'Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources' (Jul 90 861-863).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

1992

Estimating the number of states of a finite-state source.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

When is the generalized likelihood ratio test optimal?

[BibT_eX]

[DOI]

Ofer Zeitouni

IEEE Trans. Inf. Theory, 1992

On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

A sequential algorithm for the universal coding of finite memory sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm.

[BibT_eX]

[DOI]

Eli Plotnik

IEEE Trans. Inf. Theory, 1992

On the Coding Delay of a General Coder.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1992

1991

Fixed data base version of the Lempel-Ziv data compression algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

A Bayesian approach for classification of Markov sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

On Compression with Two-Way Head Machines.

[BibT_eX]

[DOI]

Dafna Sheinwald

Proceedings of the IEEE Data Compression Conference, 1991

1990

Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

Review of 'Open Problems in Communication and Computation' (Cover, T.M., and Gopinath, B., Eds.; 1987).

[BibT_eX]

IEEE Trans. Inf. Theory, 1990

On universally efficient estimation of the first order autoregressive parameter and universal data compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1990

Two-dimensional encoding by finite-state encoders.

[BibT_eX]

[DOI]

Dafna Sheinwald

IEEE Trans. Commun., 1990

1989

Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

Estimating with partial statistics the parameters of ergodic finite Markov sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

On the estimation of the order of a Markov chain and universal data compression.

[BibT_eX]

[DOI]

Michael Gutman

IEEE Trans. Inf. Theory, 1989

1988

On classification with empirically observed statistics and universal data compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

Achievable rates for a constrained Gaussian channel.

[BibT_eX]

[DOI]

Lawrence H. Ozarow

IEEE Trans. Inf. Theory, 1988

1986

Compression of two-dimensional data.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

1985

Universal decoding for finite-state channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

On universal quantization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

1984

Fixed-rate encoding of individual sequences with side information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1984

Coding for a write-once memory.

[BibT_eX]

[DOI]

AT&T Bell Lab. Tech. J., 1984

1982

On the power of straight- line computations in finite fields.

[BibT_eX]

[DOI]

Gadiel Seroussi

IEEE Trans. Inf. Theory, 1982

1980

Distortion-rate theory for individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1980

1978

Compression of individual sequences via variable-rate coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1978

Coding theorems for individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1978

1977

A universal algorithm for sequential data compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1977

Improved bounds on the local mean-square error and the bias of parameter estimators (Corresp.).

[BibT_eX]

[DOI]

Mati Wax

IEEE Trans. Inf. Theory, 1977

1976

The rate-distortion function for source coding with side information at the decoder.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1976

On the Complexity of Finite Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1976

1975

Improved Lower Bounds on Signal Parameter Estimation.

[BibT_eX]

[DOI]

D. Chazan

IEEE Trans. Inf. Theory, 1975

1974

On the Epsilon -entropy and the rate-distortion function of certain non-Gaussian processes.

[BibT_eX]

[DOI]

Jacob Binia

IEEE Trans. Inf. Theory, 1974

1973

On functionals satisfying a data-processing theorem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1973

A theorem on the entropy of certain binary sequences and applications-I.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1973

Bounds on the Epsilon -entropy of Wiener and RC processes (Corresp.).

[BibT_eX]

[DOI]

Jacob Binia

IEEE Trans. Inf. Theory, 1973

1972

Coding of sources with unknown statistics-II: Distortion relative to a fidelity criterion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1972

Coding of sources with unknown statistics-I: Probability of encoding error.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1972

Lower and upper bounds on the optimal filtering error of certain diffusion processes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1972

1971

Bounds on the rate-distortion function for stationary sources with memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1971

Capacity of a continuous memoryless channel with feedback.

[BibT_eX]

[DOI]

T. T. Kadota

IEEE Trans. Inf. Theory, 1971

Mutual information of the white Gaussian channel with and without feedback.

[BibT_eX]

[DOI]

T. T. Kadota

IEEE Trans. Inf. Theory, 1971

Bound on the average transmission time for sequential estimation systems containing an additive Gaussian noise channel.

[BibT_eX]

[DOI]

T. T. Kadota

IEEE Trans. Inf. Theory, 1971

1970

The Channel Capacity of the Postal Channel

[BibT_eX]

[DOI]

Jack K. Wolf

Inf. Control., April, 1970

The behavior of analog communication systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1970

Transmission of noisy information to a noisy receiver with minimum distortion.

[BibT_eX]

[DOI]

Jack K. Wolf

IEEE Trans. Inf. Theory, 1970

1969

The Capacity of the General Time-Discrete Channel with Finite Alphabet

[BibT_eX]

[DOI]

Inf. Control., March, 1969

Some lower bounds on signal parameter estimation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1969

On the threshold effect in radar range estimation (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1969

Binary communication over the Gaussian channel using feedback with a peak energy constraint.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1969

1968

Necessary and Sufficient Conditions for the Existence of the \epsilon-Property (A.E.P.)

[BibT_eX]

[DOI]

Inf. Control., March, 1968

1967

Asymptotic performance and complexity of a coding scheme for memoryless channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1967

1966

Further results on the asymptotic complexity of an iterative coding scheme.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1966

1965

Probability of decoding error for random phase and Rayleigh fading channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1965

1964

Generation of optimal codes by a 'pyramid-packing' argument (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1964

1963

Successive decoding scheme for memoryless channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1963

1962

Coding and decoding for time-discrete amplitude-continuous memoryless channels.

[BibT_eX]

[DOI]