Meir Feder, Neri Merhav Universal Coding for Arbitrarily Varying Sources and for Hierarchies of Model Classes. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1995, pp:82-91 [Conf]
Erdal Arikan, Neri Merhav Joint Source-Channel Coding and Guessing with Application to Sequential Decoding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1756-1769 [Journal]
Asaf Cohen, Neri Merhav Lower bounds on the error probability of block codes based on improvements on de Caen's inequality. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:290-310 [Journal]
Yariv Ephraim, Neri Merhav Lower and upper bounds on the minimum mean-square error in composite source signal estimation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1709-1724 [Journal]
Meir Feder, Neri Merhav Universal composite hypothesis testing: A competitive minimax approach. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1504-1517 [Journal]
I. Hen, Neri Merhav On the Threshold Effect in the Estimation of Chaotic Sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2894-2904 [Journal]
I. Hen, Neri Merhav On the error exponent of trellis source coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:3734-3741 [Journal]
Evgeny Levitan, Neri Merhav A competitive Neyman-Pearson approach to universal hypothesis testing with applications. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2215-2229 [Journal]
Alina Maor, Neri Merhav On joint information embedding and lossy compression. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:8, pp:2998-3008 [Journal]
Alina Maor, Neri Merhav On Joint Information Embedding and Lossy Compression in the Presence of a Stationary Memoryless Attack Channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:9, pp:3166-3175 [Journal]
Neri Merhav On random coding error exponents of watermarking systems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:420-430 [Journal]
Neri Merhav Universal detection of messages via finite-state channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:6, pp:2242-2246 [Journal]
Neri Merhav A large-deviations notion of perfect secrecy. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:2, pp:506-508 [Journal]
Neri Merhav Achievable key rates for universal simulation of random data with respect to a set of statistical tests. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:1, pp:21-30 [Journal]
Neri Merhav On joint coding for watermarking and encryption. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:1, pp:190-205 [Journal]
Neri Merhav On the shannon cipher system with a capacity-limited key-distribution channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:3, pp:1269-1273 [Journal]
Neri Merhav The estimation of the model order in exponential families. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:5, pp:1109-0 [Journal]
Neri Merhav Universal coding with minimum probability of codeword length overflow. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:556-563 [Journal]
Neri Merhav Universal classification for hidden Markov models. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:6, pp:1586-1594 [Journal]
Neri Merhav Universal decoding for memoryless Gaussian channels with a deterministic interference. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1261-1269 [Journal]
Neri Merhav On the minimum description length principle for sources with piecewise constant parameters. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:6, pp:1962-0 [Journal]
Neri Merhav Bounds on achievable convergence rates of parameter estimators via universal coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1210-0 [Journal]
Neri Merhav A comment on 'A rate of convergence result for a universal D-semifaithful code'. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:4, pp:1200-1202 [Journal]
Neri Merhav On list size exponents in rate-distortion coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:2, pp:765-769 [Journal]
Neri Merhav How many information bits does a decoder need about the channel statistics? [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1707-1714 [Journal]
Neri Merhav, Meir Feder Universal schemes for sequential decision from individual data sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1280-1292 [Journal]
Neri Merhav, Meir Feder A strong version of the redundancy-capacity theorem of universal coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:714-722 [Journal]
Neri Merhav, David L. Neuhoff Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:1, pp:135-0 [Journal]
Neri Merhav, Erik Ordentlich On causal and semicausal codes for joint information embedding and source coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:1, pp:213-226 [Journal]
Neri Merhav, Shlomo Shamai On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:11, pp:2844-2855 [Journal]
Neri Merhav, Jacob Ziv On the Wyner-Ziv problem for individual sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:3, pp:867-873 [Journal]
Neri Merhav, Jacob Ziv Estimating with partial statistics the parameters of ergodic finite Markov sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1989, v:35, n:2, pp:326-333 [Journal]
Neri Merhav, Jacob Ziv On universally efficient estimation of the first order autoregressive parameter and universal data compression. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:6, pp:1245-1254 [Journal]
Neri Merhav, Jacob Ziv A Bayesian approach for classification of Markov sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1067-1071 [Journal]
Neri Merhav, Jacob Ziv On the amount of statistical side information required for lossy data compression. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:4, pp:1112-1121 [Journal]
Gil I. Shamir, Neri Merhav Low-complexity sequential lossless coding for piecewise-stationary memoryless sources. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1498-1519 [Journal]
Yossef Steinberg, Neri Merhav Identification in the presence of side information with application to watermarking. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1410-1422 [Journal]
Tsachy Weissman, Neri Merhav Universal prediction of individual binary sequences in the presence of noise. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2151-2173 [Journal]
Tsachy Weissman, Neri Merhav Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:2, pp:396-415 [Journal]
Tsachy Weissman, Neri Merhav On limited-delay lossy coding and filtering of individual sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:3, pp:721-733 [Journal]
Tsachy Weissman, Neri Merhav On competitive prediction and its relation to rate-distortion theory. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3185-3194 [Journal]
Jacob Ziv, Neri Merhav Estimating the number of states of a finite-state source. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:1, pp:61-65 [Journal]
Jacob Ziv, Neri Merhav A measure of relative entropy between individual sequences with application to universal classification. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1270-1279 [Journal]
Neri Merhav, Tsachy Weissman Coding for the Feedback Gel'fand-Pinsker Channel and the Feedforward Wyner-Ziv Source. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:9, pp:4207-4211 [Journal]
Jacob Ziv, Neri Merhav On Context-Tree Prediction of Individual Sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1860-1866 [Journal]
Neri Merhav, Meir Feder Minimax Universal Decoding With an Erasure Option. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1664-1675 [Journal]
Neri Merhav An identity of Chernoff bounds with an interpretation in statistical physics and applications in information theory [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
Neri Merhav Shannon's secrecy system with informed receivers and its application to systematic coding for wiretapped channels [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Neri Merhav Relations between random coding exponents and the statistical physics of random codes [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
On the Wyner-Ziv problem for individual sequences [Citation Graph (, )][DBLP]
On the Shannon cipher system with a capacity-limited key-distribution channel [Citation Graph (, )][DBLP]
On context-tree prediction of individual sequences [Citation Graph (, )][DBLP]
Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source [Citation Graph (, )][DBLP]
On joint coding for watermarking and encryption [Citation Graph (, )][DBLP]
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators [Citation Graph (, )][DBLP]
The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes [Citation Graph (, )][DBLP]
Asymptotically Optimum Universal One-Bit Watermarking for Gaussian Covertexts and Gaussian Attacks [Citation Graph (, )][DBLP]
Error Exponents of Optimum Decoding for the Interference Channel [Citation Graph (, )][DBLP]
Joint source-channel coding via statistical mechanics: thermal equilibrium between the source and the channel [Citation Graph (, )][DBLP]
On the statistical physics of directed polymers in a random medium and their relation to tree codes [Citation Graph (, )][DBLP]
On Successive Refinement for the Kaspi/Heegard-Berger Problem [Citation Graph (, )][DBLP]
Statistical Physics of Signal Estimation in Gaussian Noise: Theory and Examples of Phase Transitions [Citation Graph (, )][DBLP]