default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacob Ziv
Yaakov Ziv – יעקב זיו
Person information
- unicode name: יעקב זיו
- award (2008): BBVA Foundation Frontiers of Knowledge Award
- award (1997): Paris Kanellakis Award
- award (1995): Marconi Prize
- award (1995): IEEE Richard W. Hamming Medal
- affiliation: Technion - Israel Institute of Technology, Department of Electrical Engineering, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j80]Yuval Cassuto
, Jacob Ziv:
Efficient Compression of Long Arbitrary Sequences With No Reference at the Encoder. IEEE Trans. Inf. Theory 67(1): 1-9 (2021)- 2020
- [i5]Yuval Cassuto, Jacob Ziv:
Efficient Compression of Long Arbitrary Sequences with No Reference at the Encoder. CoRR abs/2002.09893 (2020)
2010 – 2019
- 2015
- [c11]Jacob Ziv:
A constrained-dictionary version of LZ78 asymptotically achieves the finite-state compressibility with a distortion measure. ITW 2015: 1-4 - 2014
- [i4]Jacob Ziv:
A Constrained-Dictionary version of LZ78 asymptotically achieves the Finite-State Compressibility for any Individual Sequence. CoRR abs/1409.1323 (2014) - 2011
- [c10]Jacob Ziv:
An Axiomatic Approach to the Notion of Similarity of Individual Sequences and Their Classification. CCP 2011: 3-7
2000 – 2009
- 2009
- [j79]Jacob Ziv:
The universal LZ77 compression algorithm is essentially optimal for individual finite-length N-blocks. IEEE Trans. Inf. Theory 55(5): 1941-1944 (2009) - [i3]Jacob Ziv:
On the optimality of universal classifiers for finite-length individual test sequences. CoRR abs/0909.4233 (2009) - 2008
- [j78]Jacob Ziv:
On Finite Memory Universal Data Compression and Classification of Individual Sequences. IEEE Trans. Inf. Theory 54(4): 1626-1636 (2008) - 2007
- [j77]Ilan Sutskover, Shlomo Shamai, Jacob Ziv:
Constrained Information Combining: Theory and Applications for LDPC Coded Systems. IEEE Trans. Inf. Theory 53(5): 1617-1643 (2007) - [j76]Jacob Ziv, Neri Merhav:
On Context-Tree Prediction of Individual Sequences. IEEE Trans. Inf. Theory 53(5): 1860-1866 (2007) - [j75]Jacob Ziv:
Classification With Finite Memory Revisited. IEEE Trans. Inf. Theory 53(12): 4413-4421 (2007) - 2006
- [j74]Neri Merhav, Jacob Ziv:
On the Wyner-Ziv problem for individual sequences. IEEE Trans. Inf. Theory 52(3): 867-873 (2006) - [c9]Jacob Ziv:
On Limited Memory Universal Classification of Individual Sequences. ISIT 2006: 597-599 - [c8]Jacob Ziv, Neri Merhav:
On Context - Tree Prediction of Individual Sequences. ITW 2006: 232-236 - 2005
- [j73]Ilan Sutskover, Shlomo Shamai, Jacob Ziv:
Extremes of information combining. IEEE Trans. Inf. Theory 51(4): 1313-1325 (2005) - [i2]Neri Merhav, Jacob Ziv:
On the Wyner-Ziv problem for individual sequences. CoRR abs/cs/0505010 (2005) - [i1]Jacob Ziv, Neri Merhav:
On context-tree prediction of individual sequences. CoRR abs/cs/0508127 (2005) - 2004
- [j72]Jacob Ziv:
Correction to: "An Efficient Universal Prediction Algorithm for Unknown Sources With Limited Training Data". IEEE Trans. Inf. Theory 50(8): 1851-1852 (2004) - 2002
- [j71]Henry J. Landau, James E. Mazo, Shlomo Shamai, Jacob Ziv:
Shannon theory: Perspective, trends, and applications special issue dedicated to Aaron D. Wyner. IEEE Trans. Inf. Theory 48(6): 1237-1242 (2002) - [j70]Jacob Ziv:
An efficient universal prediction algorithm for unknown sources with limited training data. IEEE Trans. Inf. Theory 48(6): 1690-1693 (2002) - 2001
- [j69]Jacob Ziv:
A universal prediction lemma and applications to universal data compression and prediction. IEEE Trans. Inf. Theory 47(4): 1528-1532 (2001) - 2000
- [c7]Z. Cohen, Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv:
On the temporal HZY compression scheme. SODA 2000: 185-186
1990 – 1999
- 1999
- [j68]Amos Lapidoth, Jacob Ziv:
On the decoding of convolutional codes on an unknown channel. IEEE Trans. Inf. Theory 45(7): 2321-2332 (1999) - 1998
- [j67]Yehuda Hershkovits, Jacob Ziv:
On Sliding-Window Universal Data Compression with Limited Memory. IEEE Trans. Inf. Theory 44(1): 66-78 (1998) - [j66]Amos Lapidoth, Jacob Ziv:
On the Universality of the LZ-Based Decoding Algorithm. IEEE Trans. Inf. Theory 44(5): 1746-1755 (1998) - [j65]Aaron D. Wyner, Jacob Ziv, Abraham J. Wyner:
On the Role of Pattern Matching in Information Theory. IEEE Trans. Inf. Theory 44(6): 2045-2056 (1998) - [c6]Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv:
Augmenting Suffix Trees, with Applications. ESA 1998: 67-78 - 1997
- [j64]Neri Merhav, Jacob Ziv:
On the amount of statistical side information required for lossy data compression. IEEE Trans. Inf. Theory 43(4): 1112-1121 (1997) - [j63]Yehuda Hershkovits, Jacob Ziv:
On fixed-database universal data compression with limited memory. IEEE Trans. Inf. Theory 43(6): 1966-1976 (1997) - 1996
- [j62]Aaron D. Wyner, Jacob Ziv:
Classification with finite memory. IEEE Trans. Inf. Theory 42(2): 337-347 (1996) - [j61]J. J. Stein, Jacob Ziv, Neri Merhav:
Universal delay estimation for discrete channels. IEEE Trans. Inf. Theory 42(6): 2085-2093 (1996) - 1995
- [j60]Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
On Encoding and Decoding with Two-Way Head Machines. Inf. Comput. 116(1): 128-133 (1995) - [c5]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 - 1994
- [j59]Jacob Ziv:
On Universal Data Compression - An Intuitive Overview. J. Vis. Commun. Image Represent. 5(4): 317-321 (1994) - [j58]Aaron D. Wyner, Jacob Ziv:
The sliding-window Lempel-Ziv algorithm is asymptotically optimal. Proc. IEEE 82(6): 872-877 (1994) - 1993
- [j57]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 Trans. Inf. Theory 39(1): 312- (1993) - [j56]Jacob Ziv, Neri Merhav:
A measure of relative entropy between individual sequences with application to universal classification. IEEE Trans. Inf. Theory 39(4): 1270-1279 (1993) - 1992
- [j55]Jacob Ziv, Neri Merhav:
Estimating the number of states of a finite-state source. IEEE Trans. Inf. Theory 38(1): 61-65 (1992) - [j54]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 Trans. Inf. Theory 38(1): 66-72 (1992) - [j53]Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel:
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences. IEEE Trans. Inf. Theory 38(2): 380-385 (1992) - [j52]Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv:
A sequential algorithm for the universal coding of finite memory sources. IEEE Trans. Inf. Theory 38(3): 1002-1014 (1992) - [j51]Ofer Zeitouni, Jacob Ziv, Neri Merhav:
When is the generalized likelihood ratio test optimal? IEEE Trans. Inf. Theory 38(5): 1597-1602 (1992) - [c4]Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv:
On the Coding Delay of a General Coder. Data Compression Conference 1992: 102-111 - 1991
- [j50]Aaron D. Wyner, Jacob Ziv:
Fixed data base version of the Lempel-Ziv data compression algorithm. IEEE Trans. Inf. Theory 37(3): 878-880 (1991) - [j49]Neri Merhav, Jacob Ziv:
A Bayesian approach for classification of Markov sources. IEEE Trans. Inf. Theory 37(4): 1067-1071 (1991) - [c3]Aaron D. Wyner, Jacob Ziv:
Fixed Data Base Version of the Lempel-Ziv Data Compression Algorithm. Data Compression Conference 1991: 202-207 - [c2]Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
On Compression with Two-Way Head Machines. Data Compression Conference 1991: 218-227 - [c1]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 - 1990
- [j48]Dafna Sheinwald, Abraham Lempel, Jacob Ziv:
Two-dimensional encoding by finite-state encoders. IEEE Trans. Commun. 38(3): 341-347 (1990) - [j47]Jacob Ziv:
Review of 'Open Problems in Communication and Computation' (Cover, T.M., and Gopinath, B., Eds.; 1987). IEEE Trans. Inf. Theory 36(3): 706- (1990) - [j46]Jacob Ziv:
Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources. IEEE Trans. Inf. Theory 36(4): 861-863 (1990) - [j45]Neri Merhav, Jacob Ziv:
On universally efficient estimation of the first order autoregressive parameter and universal data compression. IEEE Trans. Inf. Theory 36(6): 1245-1254 (1990)
1980 – 1989
- 1989
- [j44]Neri Merhav, Jacob Ziv:
Estimating with partial statistics the parameters of ergodic finite Markov sources. IEEE Trans. Inf. Theory 35(2): 326-333 (1989) - [j43]Neri Merhav, Michael Gutman, Jacob Ziv:
On the estimation of the order of a Markov chain and universal data compression. IEEE Trans. Inf. Theory 35(5): 1014-1019 (1989) - [j42]Aaron D. Wyner, Jacob Ziv:
Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression. IEEE Trans. Inf. Theory 35(6): 1250-1258 (1989) - 1988
- [j41]Jacob Ziv:
On classification with empirically observed statistics and universal data compression. IEEE Trans. Inf. Theory 34(2): 278-286 (1988) - [j40]Lawrence H. Ozarow, Aaron D. Wyner, Jacob Ziv:
Achievable rates for a constrained Gaussian channel. IEEE Trans. Inf. Theory 34(3): 365-370 (1988) - 1986
- [j39]Abraham Lempel, Jacob Ziv:
Compression of two-dimensional data. IEEE Trans. Inf. Theory 32(1): 2-8 (1986) - 1985
- [j38]Jacob Ziv:
On universal quantization. IEEE Trans. Inf. Theory 31(3): 344-347 (1985) - [j37]Jacob Ziv:
Universal decoding for finite-state channels. IEEE Trans. Inf. Theory 31(4): 453-460 (1985) - 1984
- [j36]Jack K. Wolf, Aaron D. Wyner, Jacob Ziv, János Körner:
Coding for a write-once memory. AT&T Bell Lab. Tech. J. 63(6): 1089-1112 (1984) - [j35]Jacob Ziv:
Fixed-rate encoding of individual sequences with side information. IEEE Trans. Inf. Theory 30(2): 348-352 (1984) - 1982
- [j34]Abraham Lempel, Gadiel Seroussi, Jacob Ziv:
On the power of straight- line computations in finite fields. IEEE Trans. Inf. Theory 28(6): 875-879 (1982) - 1980
- [j33]Jacob Ziv:
Distortion-rate theory for individual sequences. IEEE Trans. Inf. Theory 26(2): 137-143 (1980)
1970 – 1979
- 1978
- [j32]Jacob Ziv:
Coding theorems for individual sequences. IEEE Trans. Inf. Theory 24(4): 405-412 (1978) - [j31]Jacob Ziv, Abraham Lempel:
Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5): 530-536 (1978) - 1977
- [j30]Jacob Ziv, Abraham Lempel:
A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3): 337-343 (1977) - [j29]Mati Wax, Jacob Ziv:
Improved bounds on the local mean-square error and the bias of parameter estimators (Corresp.). IEEE Trans. Inf. Theory 23(4): 529-530 (1977) - 1976
- [j28]Aaron D. Wyner, Jacob Ziv:
The rate-distortion function for source coding with side information at the decoder. IEEE Trans. Inf. Theory 22(1): 1-10 (1976) - [j27]Abraham Lempel, Jacob Ziv:
On the Complexity of Finite Sequences. IEEE Trans. Inf. Theory 22(1): 75-81 (1976) - 1975
- [j26]D. Chazan, Moshe Zakai, Jacob Ziv:
Improved Lower Bounds on Signal Parameter Estimation. IEEE Trans. Inf. Theory 21(1): 90-93 (1975) - 1974
- [j25]Jacob Binia, Moshe Zakai, Jacob Ziv:
On the Epsilon -entropy and the rate-distortion function of certain non-Gaussian processes. IEEE Trans. Inf. Theory 20(4): 517-524 (1974) - 1973
- [j24]Jacob Ziv, Moshe Zakai:
On functionals satisfying a data-processing theorem. IEEE Trans. Inf. Theory 19(3): 275-283 (1973) - [j23]Jacob Binia, Moshe Zakai, Jacob Ziv:
Bounds on the Epsilon -entropy of Wiener and RC processes (Corresp.). IEEE Trans. Inf. Theory 19(3): 359-362 (1973) - [j22]Aaron D. Wyner, Jacob Ziv:
A theorem on the entropy of certain binary sequences and applications-I. IEEE Trans. Inf. Theory 19(6): 769-772 (1973) - 1972
- [j21]Moshe Zakai, Jacob Ziv:
Lower and upper bounds on the optimal filtering error of certain diffusion processes. IEEE Trans. Inf. Theory 18(3): 325-331 (1972) - [j20]Jacob Ziv:
Coding of sources with unknown statistics-I: Probability of encoding error. IEEE Trans. Inf. Theory 18(3): 384-389 (1972) - [j19]Jacob Ziv:
Coding of sources with unknown statistics-II: Distortion relative to a fidelity criterion. IEEE Trans. Inf. Theory 18(3): 389-394 (1972) - 1971
- [j18]T. T. Kadota, Moshe Zakai, Jacob Ziv:
Mutual information of the white Gaussian channel with and without feedback. IEEE Trans. Inf. Theory 17(4): 368-371 (1971) - [j17]T. T. Kadota, Moshe Zakai, Jacob Ziv:
Capacity of a continuous memoryless channel with feedback. IEEE Trans. Inf. Theory 17(4): 372-378 (1971) - [j16]Aaron D. Wyner, Jacob Ziv:
Bounds on the rate-distortion function for stationary sources with memory. IEEE Trans. Inf. Theory 17(5): 508-513 (1971) - [j15]T. T. Kadota, Aaron D. Wyner, Jacob Ziv:
Bound on the average transmission time for sequential estimation systems containing an additive Gaussian noise channel. IEEE Trans. Inf. Theory 17(5): 514-515 (1971) - 1970
- [j14]Jack K. Wolf, Aaron D. Wyner, Jacob Ziv:
The Channel Capacity of the Postal Channel. Inf. Control. 16(2): 167-172 (1970) - [j13]Jack K. Wolf, Jacob Ziv:
Transmission of noisy information to a noisy receiver with minimum distortion. IEEE Trans. Inf. Theory 16(4): 406-411 (1970) - [j12]Jacob Ziv:
The behavior of analog communication systems. IEEE Trans. Inf. Theory 16(5): 587-594 (1970)
1960 – 1969
- 1969
- [j11]Jacob Ziv:
The Capacity of the General Time-Discrete Channel with Finite Alphabet. Inf. Control. 14(3): 233-251 (1969) - [j10]Moshe Zakai, Jacob Ziv:
On the threshold effect in radar range estimation (Corresp.). IEEE Trans. Inf. Theory 15(1): 167-170 (1969) - [j9]Jacob Ziv, Moshe Zakai:
Some lower bounds on signal parameter estimation. IEEE Trans. Inf. Theory 15(3): 386-391 (1969) - [j8]Larry A. Shepp, Jack K. Wolf, Aaron D. Wyner, Jacob Ziv:
Binary communication over the Gaussian channel using feedback with a peak energy constraint. IEEE Trans. Inf. Theory 15(4): 476-478 (1969) - 1968
- [j7]Jacob Ziv:
Necessary and Sufficient Conditions for the Existence of the \epsilon-Property (A.E.P.). Inf. Control. 12(3): 173-192 (1968) - 1967
- [j6]Jacob Ziv:
Asymptotic performance and complexity of a coding scheme for memoryless channels. IEEE Trans. Inf. Theory 13(3): 356-359 (1967) - 1966
- [j5]Jacob Ziv:
Further results on the asymptotic complexity of an iterative coding scheme. IEEE Trans. Inf. Theory 12(2): 168-171 (1966) - 1965
- [j4]Jacob Ziv:
Probability of decoding error for random phase and Rayleigh fading channels. IEEE Trans. Inf. Theory 11(1): 53-61 (1965) - 1964
- [j3]Jacob Ziv:
Generation of optimal codes by a 'pyramid-packing' argument (Corresp.). IEEE Trans. Inf. Theory 10(3): 253-255 (1964) - 1963
- [j2]Jacob Ziv:
Successive decoding scheme for memoryless channels. IEEE Trans. Inf. Theory 9(2): 97-104 (1963) - 1962
- [j1]Jacob Ziv:
Coding and decoding for time-discrete amplitude-continuous memoryless channels. IRE Trans. Inf. Theory 8(5): 199-205 (1962)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
