Universal Hypothesis Testing and Universal Decoding

  1. N. Merhav, M. Gutman, and J. Ziv, ``On the estimation of the order of a Markov chain and universal data compression,'' IEEE Trans. Inform. Theory vol. 35, no. 5, pp. 1014-1019, September 1989.
  2. N. Merhav, ``On the estimation of the model order in exponential families,'' IEEE Trans. Inform. Theory, vol. IT-35, no. 5, pp. 1109-1114, September 1989.
  3. J. Ziv and N. Merhav, ``Estimating the number of states of a finite-state source,'' IEEE Trans. Inform. Theory, vol. 38, no. 1, pp. 61-65, January 1992.
  4. O. Zeitouni, J. Ziv, and N. Merhav, ``When is the generalized likelihood ratio test optimal?'' IEEE Trans. Inform. Theory, vol. 38, no. 5, pp. 1597-1602, September 1992.
  5. N. Merhav, ``Universal decoding for memoryless Gaussian channels with a deterministic interference,'' IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1261-1269, July 1993
  6. J. Ziv and N. Merhav, ``A measure of relative entropy between individual sequences with application to universal classification,'' IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1270-1279, July 1993.
  7. N. Merhav, ``Universal detection of messages via finite-state channels,'' IEEE Trans. Inform. Theory, vol. 46, no. 6, pp. 2242-2246, September 2000.
  8. M. Feder and N. Merhav, ``Universal composite hypothesis testing: A competitive minimax approach,'' (invited paper) IEEE Trans. Inform. Theory, special issue in memory of Aaron D. Wyner, vol. 48, no. 6, pp. 1504-1517, June 2002.
  9. E. Levitan and N. Merhav, ``A competitive Neyman-Pearson approach to universal hypothesis testing with applications,'' IEEE Trans. Inform. Theory, vol. 48, no. 8, pp. 2215-2229, August 2002.
  10. N. Merhav, ``An information-theoretic view of watermark embedding-detection and geometric attacks,'' presented at WaCha `05 , Barcelona, Spain, June 2005.
  11. N. Merhav and E. Sabbag, ``Optimal watermark embedding and detection strategies under limited detection resources,'' IEEE Trans. Inform. Theory, vol. 54, no. 1, pp. 255-274, January 2008.
  12. N. Merhav and M. Feder, ``Minimax universal decoding with an erasure option,'' IEEE Trans. Inform. Theory, vol. 53, no. 5, pp. 1664-1675, May 2007.
  13. Y. Akirav and N. Merhav, ``Competitive minimax universal decoding for several ensembles of random codes,'' IEEE Trans. Inform. Theory, vol. 55, no. 4, pp. 1450-1459, April 2009.
  14. N. Merhav, ``Universal decoding for arbitrary channels relative to a given class of decoding metrics,'' IEEE Trans. Inform. Theory, vol. 59, no. 9, pp. 5566-5576, September 2013.
  15. N. Merhav, ``Asymptotically optimal decision rules for joint detection and source coding,'' IEEE Trans. Inform. Theory, vol. 60, no. 11, pp. 6787-6795, November 2014.
  16. W. Huleihel and N. Merhav, ``Universal decoding for Gaussian intersymbol inteference channels,'' IEEE Trans. Inform. Theory, vol. 61, no. 4, pp. 1606-1618, April 2015.
  17. W. Huleihel, N. Weinberger and N. Merhav, ``Erasure/list random coding error exponents are not universally achievable,'' IEEE Trans. Inform. Theory, vol. 62, no. 10, pp. 5403-5421, October 2016.
  18. N. Merhav, ``Universal decoding for source-channel coding with side information,'' Communications in Information and Systems, vol. 16, no. 1, pp. 17-58, 2016.
  19. N. Weinberger and N. Merhav, ``Channel detection in coded communication,'' submitted to IEEE Trans. Inform. Theory, September 2015.
  20. B. Tondi, M. Barni, and N. Merhav, ``Detection games with a fully active attacker,'' in Proc. 7th IEEE Innternational Workshop on Information Forensics and Security (WIFS 2015), Rome, Italy, November 16-19, 2015.
  21. N. Merhav, ``Universal decoding using a noisy codebook,'' submitted to IEEE Trans. Inform. Theory, September 2016.
  22. N. Merhav, ``Reliability of universal decoding based on vector-quantized codewords,'' IEEE Trans. Inform. Theory, vol. 63, no. 5, pp. 2696-2709, May 2017.
  23. R. Averbuch and N. Merhav, ``Exact ramdom coding exponents and universal decoders for the asymmetric broadcast channel,'' submitted to IEEE Trans. Inform. Theory, February 2017.
  24. B. Tondi, N. Merhav and M. Barni, ``Detection games under fully active adversaries,'' submitted to IEEE Trans. Inform. Theory, February 2018.