2008 |
57 | EE | Jacob Ziv:
On Finite Memory Universal Data Compression and Classification of Individual Sequences.
IEEE Transactions on Information Theory 54(4): 1626-1636 (2008) |
2007 |
56 | EE | Jacob Ziv:
Classification With Finite Memory Revisited.
IEEE Transactions on Information Theory 53(12): 4413-4421 (2007) |
55 | EE | Ilan Sutskover,
Shlomo Shamai,
Jacob Ziv:
Constrained Information Combining: Theory and Applications for LDPC Coded Systems.
IEEE Transactions on Information Theory 53(5): 1617-1643 (2007) |
54 | EE | Jacob Ziv,
Neri Merhav:
On Context-Tree Prediction of Individual Sequences.
IEEE Transactions on Information Theory 53(5): 1860-1866 (2007) |
2006 |
53 | EE | Jacob Ziv:
On Finite Memory Universal Data Compression and Classification of Individual Sequences
CoRR abs/cs/0612019: (2006) |
52 | EE | Neri Merhav,
Jacob Ziv:
On the Wyner-Ziv problem for individual sequences.
IEEE Transactions on Information Theory 52(3): 867-873 (2006) |
2005 |
51 | EE | Neri Merhav,
Jacob Ziv:
On the Wyner-Ziv problem for individual sequences
CoRR abs/cs/0505010: (2005) |
50 | EE | Jacob Ziv,
Neri Merhav:
On context-tree prediction of individual sequences
CoRR abs/cs/0508127: (2005) |
49 | EE | Ilan Sutskover,
Shlomo Shamai,
Jacob Ziv:
Extremes of information combining.
IEEE Transactions on Information Theory 51(4): 1313-1325 (2005) |
2004 |
48 | | Jacob Ziv:
Correction to: "An Efficient Universal Prediction Algorithm for Unknown Sources With Limited Training Data".
IEEE Transactions on Information Theory 50(8): 1851-1852 (2004) |
2002 |
47 | | Henry J. Landau,
James E. Mazo,
Shlomo Shamai,
Jacob Ziv:
Shannon theory: Perspective, trends, and applications special issue dedicated to Aaron D. Wyner.
IEEE Transactions on Information Theory 48(6): 1237-1242 (2002) |
46 | | Jacob Ziv:
An efficient universal prediction algorithm for unknown sources with limited training data.
IEEE Transactions on Information Theory 48(6): 1690-1693 (2002) |
2001 |
45 | | Jacob Ziv:
A universal prediction lemma and applications to universal data compression and prediction.
IEEE Transactions on Information Theory 47(4): 1528-1532 (2001) |
2000 |
44 | EE | Z. Cohen,
Yossi Matias,
S. Muthukrishnan,
Süleyman Cenk Sahinalp,
Jacob Ziv:
On the temporal HZY compression scheme.
SODA 2000: 185-186 |
1999 |
43 | | Amos Lapidoth,
Jacob Ziv:
On the decoding of convolutional codes on an unknown channel.
IEEE Transactions on Information Theory 45(7): 2321-2332 (1999) |
1998 |
42 | EE | Yossi Matias,
S. Muthukrishnan,
Süleyman Cenk Sahinalp,
Jacob Ziv:
Augmenting Suffix Trees, with Applications.
ESA 1998: 67-78 |
41 | | Yehuda Hershkovits,
Jacob Ziv:
On Sliding-Window Universal Data Compression with Limited Memory.
IEEE Transactions on Information Theory 44(1): 66-78 (1998) |
40 | | Amos Lapidoth,
Jacob Ziv:
On the Universality of the LZ-Based Decoding Algorithm.
IEEE Transactions on Information Theory 44(5): 1746-1755 (1998) |
39 | | Aaron D. Wyner,
Jacob Ziv,
A. J. Wyner:
On the Role of Pattern Matching in Information Theory.
IEEE Transactions on Information Theory 44(6): 2045-2056 (1998) |
1997 |
38 | | Neri Merhav,
Jacob Ziv:
On the amount of statistical side information required for lossy data compression.
IEEE Transactions on Information Theory 43(4): 1112-1121 (1997) |
37 | | Yehuda Hershkovits,
Jacob Ziv:
On fixed-database universal data compression with limited memory.
IEEE Transactions on Information Theory 43(6): 1966-1976 (1997) |
1996 |
36 | | Aaron D. Wyner,
Jacob Ziv:
Classification with finite memory.
IEEE Transactions on Information Theory 42(2): 337-347 (1996) |
35 | | J. Stein,
Jacob Ziv,
Neri Merhav:
Universal delay estimation for discrete channels.
IEEE Transactions on Information Theory 42(6): 2085-2093 (1996) |
1995 |
34 | | Martin Farach,
Michiel O. Noordewier,
Serap A. Savari,
Larry A. Shepp,
Aaron D. Wyner,
Jacob Ziv:
On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence.
SODA 1995: 48-57 |
33 | | Dafna Sheinwald,
Abraham Lempel,
Jacob Ziv:
On Encoding and Decoding with Two-Way Head Machines
Inf. Comput. 116(1): 128-133 (1995) |
1993 |
32 | | Jacob Ziv:
Correction to 'Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources' (Jul 90 861-863).
IEEE Transactions on Information Theory 39(1): 312- (1993) |
31 | | Jacob Ziv,
Neri Merhav:
A measure of relative entropy between individual sequences with application to universal classification.
IEEE Transactions on Information Theory 39(4): 1270-1279 (1993) |
1992 |
30 | | Marcelo J. Weinberger,
Abraham Lempel,
Jacob Ziv:
On the Coding Delay of a General Coder.
Data Compression Conference 1992: 102-111 |
29 | | Jacob Ziv,
Neri Merhav:
Estimating the number of states of a finite-state source.
IEEE Transactions on Information Theory 38(1): 61-65 (1992) |
28 | | Eli Plotnik,
Marcelo J. Weinberger,
Jacob Ziv:
Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm.
IEEE Transactions on Information Theory 38(1): 66-72 (1992) |
27 | | Marcelo J. Weinberger,
Jacob Ziv,
Abraham Lempel:
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences.
IEEE Transactions on Information Theory 38(2): 380-385 (1992) |
26 | | Marcelo J. Weinberger,
Abraham Lempel,
Jacob Ziv:
A sequential algorithm for the universal coding of finite memory sources.
IEEE Transactions on Information Theory 38(3): 1002-1014 (1992) |
25 | | Ofer Zeitouni,
Jacob Ziv,
Neri Merhav:
When is the generalized likelihood ratio test optimal?
IEEE Transactions on Information Theory 38(5): 1597- (1992) |
1991 |
24 | | Aaron D. Wyner,
Jacob Ziv:
Fixed Data Base Version of the Lempel-Ziv Data Compression Algorithm.
Data Compression Conference 1991: 202-207 |
23 | | Dafna Sheinwald,
Abraham Lempel,
Jacob Ziv:
On Compression with Two-Way Head Machines.
Data Compression Conference 1991: 218-227 |
22 | | Marcelo J. Weinberger,
Jacob Ziv,
Abraham Lempel:
On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual Sequences.
Data Compression Conference 1991: 239-246 |
21 | | Aaron D. Wyner,
Jacob Ziv:
Fixed data base version of the Lempel-Ziv data compression algorithm.
IEEE Transactions on Information Theory 37(3): 878- (1991) |
20 | | Neri Merhav,
Jacob Ziv:
A Bayesian approach for classification of Markov sources.
IEEE Transactions on Information Theory 37(4): 1067-1071 (1991) |
1990 |
19 | | Jacob Ziv:
Review of 'Open Problems in Communication and Computation' (Cover, T.M., and Gopinath, B., Eds.; 1987).
IEEE Transactions on Information Theory 36(3): 706- (1990) |
18 | | Jacob Ziv:
Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources.
IEEE Transactions on Information Theory 36(4): 861- (1990) |
17 | | Neri Merhav,
Jacob Ziv:
On universally efficient estimation of the first order autoregressive parameter and universal data compression.
IEEE Transactions on Information Theory 36(6): 1245-1254 (1990) |
1989 |
16 | | Neri Merhav,
Jacob Ziv:
Estimating with partial statistics the parameters of ergodic finite Markov sources.
IEEE Transactions on Information Theory 35(2): 326-333 (1989) |
15 | | Neri Merhav,
Michael Gutman,
Jacob Ziv:
On the estimation of the order of a Markov chain and universal data compression.
IEEE Transactions on Information Theory 35(5): 1014-1019 (1989) |
14 | | Aaron D. Wyner,
Jacob Ziv:
Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression.
IEEE Transactions on Information Theory 35(6): 1250-1258 (1989) |
1988 |
13 | | Jacob Ziv:
On classification with empirically observed statistics and universal data compression.
IEEE Transactions on Information Theory 34(2): 278-286 (1988) |
12 | | Lawrence H. Ozarow,
Aaron D. Wyner,
Jacob Ziv:
Achievable rates for a constrained Gaussian channel.
IEEE Transactions on Information Theory 34(3): 365-370 (1988) |
1986 |
11 | | Abraham Lempel,
Jacob Ziv:
Compression of two-dimensional data.
IEEE Transactions on Information Theory 32(1): 2-8 (1986) |
1985 |
10 | | Jacob Ziv:
On universal quantization.
IEEE Transactions on Information Theory 31(3): 344-347 (1985) |
9 | | Jacob Ziv:
Universal decoding for finite-state channels.
IEEE Transactions on Information Theory 31(4): 453-460 (1985) |
1984 |
8 | | Jacob Ziv:
Fixed-rate encoding of individual sequences with side information.
IEEE Transactions on Information Theory 30(2): 348-352 (1984) |
1982 |
7 | | Abraham Lempel,
Gadiel Seroussi,
Jacob Ziv:
On the power of straight- line computations in finite fields.
IEEE Transactions on Information Theory 28(6): 875-879 (1982) |
1978 |
6 | | Jacob Ziv:
Coding Theorems for Individual Sequences.
IEEE Transactions on Information Theory 24(4): 405-412 (1978) |
5 | | Jacob Ziv,
Abraham Lempel:
Compression of Individual Sequences via Variable-Rate Coding.
IEEE Transactions on Information Theory 24(5): 530-536 (1978) |
1977 |
4 | | Jacob Ziv,
Abraham Lempel:
A Universal Algorithm for Sequential Data Compression.
IEEE Transactions on Information Theory 23(3): 337-343 (1977) |
1970 |
3 | | Jack K. Wolf,
Aaron D. Wyner,
Jacob Ziv:
The Channel Capacity of the Postal Channel
Information and Control 16(2): 167-172 (1970) |
1969 |
2 | | Jacob Ziv:
The Capacity of the General Time-Discrete Channel with Finite Alphabet
Information and Control 14(3): 233-251 (1969) |
1968 |
1 | | Jacob Ziv:
Necessary and Sufficient Conditions for the Existence of the \epsilon-Property (A.E.P.)
Information and Control 12(3): 173-192 (1968) |