The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Neri Merhav: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Neri Merhav, Meir Feder
    Universal Sequential Learning and Decision from Individual Data Sequences. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:413-427 [Conf]
  2. Tsachy Weissman, Neri Merhav
    On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:19-28 [Conf]
  3. 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]
  4. Neri Merhav, Meir Feder
    The Minimax Redundancy is a Lower Bound for Most Sources. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1994, pp:52-61 [Conf]
  5. Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinberger, Anelia Somekh-Baruch, Neri Merhav
    Discrete Universal Filtering Through Incremental Parsing. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:352-361 [Conf]
  6. Neri Merhav, Bhaskaran Vasudev
    A Multiplication-Free Approximate Algorithm for the Inverse Discrete Cosine Transform. [Citation Graph (0, 0)][DBLP]
    ICIP (2), 1999, pp:759-763 [Conf]
  7. Neri Merhav
    On Joint Coding for Watermarking and Encryption. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 2005, pp:1-10 [Conf]
  8. Ronny Meir, Neri Merhav
    On the Stochastic Complexity of Learning Realizable and Unrealizable Rules. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1995, v:19, n:3, pp:241-261 [Journal]
  9. Renato Kresch, Neri Merhav
    Fast DCT domain filtering using the DCT and the DST. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 1999, v:8, n:6, pp:821-833 [Journal]
  10. Neri Merhav
    Multiplication-free approximate algorithms for compressed-domain linear operations on images. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 1999, v:8, n:2, pp:247-254 [Journal]
  11. Erdal Arikan, Neri Merhav
    Guessing Subject to Distortion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1041-1056 [Journal]
  12. 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]
  13. 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]
  14. Yariv Ephraim, Neri Merhav
    Hidden Markov processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1518-1569 [Journal]
  15. 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]
  16. 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]
  17. Meir Feder, Neri Merhav
    Relations between entropy and error probability. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:259-0 [Journal]
  18. Meir Feder, Neri Merhav
    Hierarchical universal coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1354-1364 [Journal]
  19. Meir Feder, Neri Merhav, Michael Gutman
    Universal prediction of individual sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1258-1270 [Journal]
  20. Meir Feder, Neri Merhav, Michael Gutman
    Correction to 'Universal prediction of individual sequences' (Jul 92 1258-1270). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:285- [Journal]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. Alina Maor, Neri Merhav
    Two-way successively refined joint source-channel coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1483-1494 [Journal]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. Neri Merhav, Erdal Arikan
    The Shannon cipher system with a guessing wiretapper. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1860-1866 [Journal]
  43. 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]
  44. 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]
  45. Neri Merhav, Meir Feder
    Universal Prediction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2124-2147 [Journal]
  46. Neri Merhav, Meir Feder, Michael Gutman
    Some properties of sequential predictors for binary Markov sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:3, pp:887-892 [Journal]
  47. Neri Merhav, Michael Gutman, Jacob Ziv
    On the estimation of the order of a Markov chain and universal data compression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:5, pp:1014-1019 [Journal]
  48. Neri Merhav, Ioannis Kontoyiannis
    Source coding exponents for zero-delay coding with finite memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:3, pp:609-625 [Journal]
  49. Neri Merhav, Gideon Kaplan, Amos Lapidoth, Shlomo Shamai
    On information rates for mismatched decoders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:1953-1967 [Journal]
  50. 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]
  51. 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]
  52. Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Marcelo J. Weinberger
    On sequential strategies for loss functions with memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:7, pp:1947-1958 [Journal]
  53. Neri Merhav, Ron M. Roth, Erdal Arikan
    Hierarchical Guessing with a Fidelity Criterion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:330-337 [Journal]
  54. 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]
  55. Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger
    Optimal prefix codes for sources with two-sided geometric distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:121-135 [Journal]
  56. Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger
    Coding of sources with two-sided geometric distributions and unknown parameters. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:229-236 [Journal]
  57. Neri Merhav, Tsachy Weissman
    Scanning and prediction in multidimensional data arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:1, pp:65-82 [Journal]
  58. Neri Merhav, Marcelo J. Weinberger
    On universal simulation of information sources using training data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:1, pp:5-20 [Journal]
  59. Neri Merhav, Marcelo J. Weinberger
    Addendum to "On Universal Simulation of Information Sources Using Training Data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:9, pp:3381-3383 [Journal]
  60. 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]
  61. 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]
  62. 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]
  63. 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]
  64. 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]
  65. 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]
  66. Anelia Somekh-Baruch, Neri Merhav
    On the error exponent and capacity games of private watermarking systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:3, pp:537-562 [Journal]
  67. Anelia Somekh-Baruch, Neri Merhav
    On the capacity game of public watermarking systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:20, n:3, pp:511-524 [Journal]
  68. Anelia Somekh-Baruch, Neri Merhav
    On the capacity game of private fingerprinting systems under collusion attacks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:884-899 [Journal]
  69. J. Stein, Jacob Ziv, Neri Merhav
    Universal delay estimation for discrete channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2085-2093 [Journal]
  70. 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]
  71. Yossef Steinberg, Neri Merhav
    On Successive Refinement for the Wyner-Ziv Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:8, pp:1636-1654 [Journal]
  72. Yossef Steinberg, Neri Merhav
    On hierarchical joint source-channel coding with degraded side information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:3, pp:886-903 [Journal]
  73. Marcelo J. Weinberger, Neri Merhav, Meir Feder
    Optimal sequential probability assignment for individual sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:384-396 [Journal]
  74. 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]
  75. 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]
  76. 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]
  77. 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]
  78. Tsachy Weissman, Neri Merhav
    On causal source codes with side information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4003-4013 [Journal]
  79. Tsachy Weissman, Neri Merhav, Anelia Somekh-Baruch
    Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1849-1866 [Journal]
  80. Ofer Zeitouni, Jacob Ziv, Neri Merhav
    When is the generalized likelihood ratio test optimal? [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:5, pp:1597-0 [Journal]
  81. 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]
  82. 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]
  83. 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]
  84. Tsachy Weissman, Erik Ordentlich, Marcelo J. Weinberger, Anelia Somekh-Baruch, Neri Merhav
    Universal Filtering Via Prediction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:4, pp:1253-1264 [Journal]
  85. Neri Merhav, Shlomo Shamai
    Information Rates Subject to State Masking. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:6, pp:2254-2261 [Journal]
  86. Anelia Somekh-Baruch, Neri Merhav
    Achievable Error Exponents for the Private Fingerprinting Game. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1827-1838 [Journal]
  87. 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]
  88. 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]
  89. Mauro Barni, Angela D'Angelo, Neri Merhav
    Expanding the class of watermark de-synchronization attacks. [Citation Graph (0, 0)][DBLP]
    MM&Sec, 2007, pp:195-204 [Conf]
  90. 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]
  91. Neri Merhav, Erez Sabbag
    Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  92. Asaf Cohen, Tsachy Weissman, Neri Merhav
    Scanning and Sequential Decision Making for Multi-Dimensional Data - Part II: the Noisy Case [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  93. 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]
  94. Asaf Cohen, Neri Merhav, Tsachy Weissman
    Scanning and Sequential Decision Making for Multi-Dimensional Data - Part I: the Noiseless Case [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  95. Neri Merhav, Meir Feder
    Universal decoding with an erasure option [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  96. Yaniv Akirav, Neri Merhav
    Competitive minimax universal decoding for several ensembles of random codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  97. 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]

  98. On the Wyner-Ziv problem for individual sequences [Citation Graph (, )][DBLP]


  99. On the Shannon cipher system with a capacity-limited key-distribution channel [Citation Graph (, )][DBLP]


  100. On context-tree prediction of individual sequences [Citation Graph (, )][DBLP]


  101. Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source [Citation Graph (, )][DBLP]


  102. On joint coding for watermarking and encryption [Citation Graph (, )][DBLP]


  103. Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators [Citation Graph (, )][DBLP]


  104. The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes [Citation Graph (, )][DBLP]


  105. Asymptotically Optimum Universal One-Bit Watermarking for Gaussian Covertexts and Gaussian Attacks [Citation Graph (, )][DBLP]


  106. Error Exponents of Optimum Decoding for the Interference Channel [Citation Graph (, )][DBLP]


  107. Joint source-channel coding via statistical mechanics: thermal equilibrium between the source and the channel [Citation Graph (, )][DBLP]


  108. On the statistical physics of directed polymers in a random medium and their relation to tree codes [Citation Graph (, )][DBLP]


  109. On Successive Refinement for the Kaspi/Heegard-Berger Problem [Citation Graph (, )][DBLP]


  110. Statistical Physics of Signal Estimation in Gaussian Noise: Theory and Examples of Phase Transitions [Citation Graph (, )][DBLP]


  111. Physics of the Shannon Limits [Citation Graph (, )][DBLP]


  112. Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding [Citation Graph (, )][DBLP]


  113. Error Exponents for Broadcast Channels with Degraded Message Sets [Citation Graph (, )][DBLP]


  114. Efficient On-line Schemes for Encoding Individual Sequences with Side Information at the Decoder [Citation Graph (, )][DBLP]


  115. Another Look at the Physics of Large Deviations With Application to Rate-Distortion Theory [Citation Graph (, )][DBLP]


  116. Optimum estimation via gradients of partition functions and information measures: a statistical-mechanical perspective [Citation Graph (, )][DBLP]


  117. Rate-distortion function via minimum mean square error estimation [Citation Graph (, )][DBLP]


  118. Threshold effects in parameter estimation as phase transitions in statistical mechanics [Citation Graph (, )][DBLP]


  119. Information Theory and Statistical Physics - Lecture Notes [Citation Graph (, )][DBLP]


  120. Data processing theorems and the second law of thermodynamics [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002