Jacob Ziv | Academic Influence

Why Is Jacob Ziv Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jacob Ziv is an Israeli electrical engineer who, along with Abraham Lempel, developed the LZ family of lossless data compression algorithms. Biography Ziv was born in Tiberias, British mandate Palestine, on 27 November 1931. He received the B.Sc., Dip. Eng., and M.Sc. degrees, all in electrical engineering, from the Technion – Israel Institute of Technology in 1954, and 1957, respectively, and the D.Sc. degree from the Massachusetts Institute of Technology in 1962.

(See a Problem?)

Jacob Ziv's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

A universal algorithm for sequential data compression (1977) (5500)
Compression of individual sequences via variable-rate coding (1978) (3553)
The rate-distortion function for source coding with side information at the decoder (1976) (3035)
On the Complexity of Finite Sequences (1976) (2317)
Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression (1989) (273)
Some lower bounds on signal parameter estimation (1969) (249)
Source coding for multiple descriptions (1980) (219)
Transmission of noisy information to a noisy receiver with minimum distortion (1970) (208)
Compression of two-dimensional data (1986) (193)
A theorem on the entropy of certain binary sequences and applications-I (1973) (190)
Improved Lower Bounds on Signal Parameter Estimation (1975) (184)
Coding theorems for individual sequences (1978) (170)
On universal quantization (1985) (166)
A Measure of Relative Entropy between Individual Sequences with Application to Universal Classification (1993) (164)
When Is The Generalized Likelihood Ratio Test Optimal? (1991) (157)
On classification with empirically observed statistics and universal data compression (1988) (143)
On the estimation of the order of a Markov chain and universal data compression (1989) (141)
Mutual information of the white Gaussian channel with and without feedback (1971) (128)
The sliding-window Lempel-Ziv algorithm is asymptotically optimal (1994) (125)
Universal decoding for finite-state channels (1985) (115)
A sequential algorithm for the universal coding of finite memory sources (1992) (95)
Upper Bounds On The Probability Of Sequences Emitted By Finite-state Sources And On The Redundancy Of The Lempel-Ziv Algorithm (1991) (92)
Coding of sources with unknown statistics-II: Distortion relative to a fidelity criterion (1972) (91)
Extremes of information combining (2005) (87)
On functionals satisfying a data-processing theorem (1973) (86)
Coding for a write-once memory (1984) (82)
On the Role of Pattern Matching in Information Theory (1998) (69)
Estimating the number of states of a finite-state source (1992) (68)
Distortion-rate theory for individual sequences (1980) (66)
The behavior of analog communication systems (1970) (64)
Fixed data base version of the Lempel-Ziv data compression algorithm (1991) (63)
Bounds on the rate-distortion function for stationary sources with memory (1971) (59)
Augmenting Suffix Trees, with Applications (1998) (48)
On the Universality of the LZ-Based Decoding Algorithm (1998) (48)
On the threshold effect in radar range estimation (Corresp.) (1969) (41)
Compression of Two-Dimensional Images (1985) (41)
On the entropy of DNA: algorithms and measurements based on memory and rapid convergence (1995) (41)
A Generalization of the Rate-Distortion Theory and Applications (1975) (41)
Lower and upper bounds on the optimal filtering error of certain diffusion processes (1972) (41)
Capacity of a continuous memoryless channel with feedback (1971) (39)
Coding of sources with unknown statistics-I: Probability of encoding error (1972) (38)
Achievable rates for a constrained Gaussian channel (1988) (38)
On communication of analog data from a bounded source space (1969) (33)
Compression, tests for randomness and estimating the statistical model of an individual sequence (1990) (26)
Fixed-rate encoding of individual sequences with side information (1984) (25)
On the Epsilon -entropy and the rate-distortion function of certain non-Gaussian processes (1974) (25)
On the Wyner-Ziv problem for individual sequences (2005) (25)
On Sliding-Window Universal Data Compression with Limited Memory (1998) (24)
Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources (1990) (23)
Two-dimensional encoding by finite-state encoders (1990) (22)
Classification with finite memory (1996) (21)
Binary communication over the Gaussian channel using feedback with a peak energy constraint (1969) (20)
A universal prediction lemma and applications to universal data compression and prediction (2000) (20)
On the optimal asymptotic performance of universal ordering and discrimination of individual sequences (1991) (20)
The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length $N$-Blocks (2009) (18)
On the amount of statistical side information required for lossy data compression (1997) (17)
An efficient universal prediction algorithm for unknown sources with limited training data (2002) (15)
A Bayesian approach for classification of Markov sources (1991) (14)
On Encoding and Decoding with Two-Way Head Machines (1995) (14)
Back from infinity: a constrained resources approach to information theory (1997) (14)
Constrained Information Combining: Theory and Applications for LDPC Coded Systems (2007) (12)
On fixed-database universal data compression with limited memory (1997) (12)
On Finite Memory Universal Data Compression and Classification of Individual Sequences (2006) (10)
On the power of straight- line computations in finite fields (1982) (10)
Universal delay estimation for discrete channels (1996) (10)
The Channel Capacity of the Postal Channel (1970) (9)
Bounds on the bias of signal parameter estimators (1969) (8)
Successive decoding scheme for memoryless channels (1963) (8)
Iterative decoding of low-density parity check codes over compound channels (2002) (8)
Further results on the asymptotic complexity of an iterative coding scheme (1966) (7)
Universal sequential decoding (1998) (7)
Asymptotic performance and complexity of a coding scheme for memoryless channels (1967) (7)
Probability of decoding error for random phase and Rayleigh fading channels (1965) (7)
Improved bounds on the local mean-square error and the bias of parameter estimators (Corresp.) (1977) (7)
Coding and decoding for time-discrete amplitude-continuous memoryless channels (1962) (7)
Complexity and Coherence of Sequences (1985) (6)
Classification With Finite Memory Revisited (2007) (6)
Bound on the average transmission time for sequential estimation systems containing an additive Gaussian noise channel (1971) (5)
Estimating with partial statistics the parameters of ergodic finite Markov sources (1989) (5)
On Context - Tree Prediction of Individual Sequences (2005) (5)
Correction to: "An Efficient Universal Prediction Algorithm for Unknown Sources With Limited Training Data" (2004) (4)
On compression with two-way head machines (1991) (4)
Compression of pictures by finite state encoders (1990) (4)
Generation of optimal codes by a 'pyramid-packing' argument (Corresp.) (1964) (4)
Universal decoding for noisy channels: an algorithmic approach (1997) (4)
On the decoding of convolutional codes on an unknown channel (1999) (4)
On the temporal HZY compression scheme (2000) (3)
Shannon theory: Perspective, trends, and applications special issue dedicated to Aaron D. Wyner (2002) (3)
A constrained-dictionary version of LZ78 asymptotically achieves the finite-state compressibility with a distortion measure (2015) (3)
Correction to 'Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources' (Jul 90 861-863) (1993) (3)
A Constrained-Dictionary version of LZ78 asymptotically achieves the Finite-State Compressibility for any Individual Sequence (2014) (3)
The Capacity of the General Time-Discrete Channel with Finite Alphabet (1969) (2)
Bounds on the Epsilon -entropy of Wiener and RC processes (Corresp.) (1973) (2)
An Axiomatic Approach to the Notion of Similarity of Individual Sequences and Their Classification (2011) (2)
Efficient Compression of Long Arbitrary Sequences With No Reference at the Encoder (2020) (2)
Another look at universal data compression (1994) (2)
On Context—Tree Prediction of Individual Sequences (2005) (2)
Inequalities for source coding: some are more equal than others (1995) (1)
Augmenting Su � x Trees with Applications (2005) (1)
Data Compression Panel Discussion (1972) (1)
On the application of Kirchhoff's laws to communication nets (1963) (1)
On universally efficient estimation of the first order autoregressive parameter and universal data compression (1990) (1)
On the coding delay of a general coder (1992) (1)
A Note on the Compaction of long Training Sequences for Universal Classification -a Non-Probabilistic Approach (2011) (1)
Necessary and Sufficient Conditions for the Existence of the \epsilon-Property (A.E.P.) (1968) (1)
Fixed Data Base Version Of The Lempel-Ziv Data Compression Algorithm (1991) (1)
On The Optimal Asymptotic Performance Of Universal Ordering And Discrimination Of Individual Sequences (1991) (0)
On the optimality of universal classifiers for finite-length individual test sequences (2009) (0)
In Search of a One-Way Function (1987) (0)
Axiomatic Non-Probabilistic Classification of Individual Sequences (2011) (0)
An Axiomatic, Non-Probabilistic Approach to Classification of Individual Sequences (2011) (0)
Universal Discrimination of Individual Sequences via Finite-State Classifiers (1993) (0)
Necessary and Sufficient Conditions for the Existence of the e-Property ( A (2004) (0)
Universal compression with restricted training data and constrained latency (1998) (0)
On Universal Data Compression - An Intuitive Overview (1994) (0)
On Classification with Partial Statistics and Universal Data Compression (1987) (0)
On Limited Memory Universal Classification of Individual Sequences (2006) (0)
Finite Storage Discriminators for Ergodic Processes (1993) (0)
Universal Compaction of large Data Bases for the Classification of Individual Test Sequences -an Axiomatic, Non-Probabilistic Approach (2011) (0)
Review of 'Open Problems in Communication and Computation' (Cover, T.M., and Gopinath, B., Eds.; 1987) (1990) (0)
United States Patent ( 19 ) Chu ( 54 ) MULTI-CODEBOOK CODING PROCESS 75 ) (2017) (0)
On sequential universal coding of sequences with limited amount of training data (2000) (0)
Jeffrey and Holly Ullman Coding Day 26 October , 2009 10 : 45 Coffee & Tagging 11 : 05 On the Optimality of Universal Classifiers for finite-length Individual Test Sequences Specifications (2009) (0)
A universal prediction lemma and applications to universal data compression (1999) (0)
Use Of Lempel-ziv Algorithm For Nonparametric Discrimination: Simulation Experiment (1991) (0)
Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels (2004) (0)
Bounds on universal coding: the next generation (1994) (0)

This paper list is powered by the following services:

Other Resources About Jacob Ziv

en.wikipedia.org

What Schools Are Affiliated With Jacob Ziv?

Jacob Ziv is affiliated with the following schools:

Jacob Ziv's AcademicInfluence.com Rankings

Computer Science

Image Attributions

Image Source for Jacob Ziv