World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
54
Citations
11316
World Ranking
4586
National Ranking
72

Research.com Recognitions

  • 1999 - IEEE Fellow For contributions to universal methods of prediction and data compression.

Overview

Neri Merhav is affiliated with the Technion - Israel Institute of Technology in Israel. Their research spans multiple fields within computer science and engineering, with significant contributions in areas such as wireless communication security techniques and DNA and biological computing.

Their work crosses several subfields, including electrical and electronic engineering, molecular biology, computer networks and communications, artificial intelligence, and computational theory and mathematics. They have contributed extensively to topics related to cellular automata and applications, algorithms and data compression, error correcting code techniques, cooperative communication and network coding, as well as advanced biosensing and bioanalysis techniques.

Merhav has published in prominent venues such as:

  • arXiv (Cornell University)
  • IEEE Transactions on Information Theory
  • Entropy
  • 2022 IEEE International Symposium on Information Theory (ISIT)
  • IEEE BITS the Information Theory Magazine

Some of their recent publications include:

  • The DNA Storage Channel: Capacity and Error Probability Bounds, 2022, IEEE Transactions on Information Theory
  • Large Deviations Behavior of the Logarithmic Error Probability of Random Codes, 2020, IEEE Transactions on Information Theory
  • The MMI Decoder is Asymptotically Optimal for the Typical Random Code and for the Expurgated Code, 2020, arXiv (Cornell University)
  • Optimal work extraction and the minimum description length principle, 2020, Journal of Statistical Mechanics Theory and Experiment
  • Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian-Wolf Codes, 2021, Entropy

Merhav frequently collaborates with co-authors such as Ran Tamir, Nir Weinberger, Asaf Cohen, Sergey Loyka, and Anatoly Khina.

The scientist was recognized as an IEEE Fellow in 1999 for contributions to universal methods of prediction and data compression.

Best Publications

  • Hidden Markov processes

    Y. Ephraim;N. Merhav

  • On information rates for mismatched decoders

    N. Merhav;G. Kaplan;A. Lapidoth;S. Shamai Shitz

  • Universal prediction

    N. Merhav;M. Feder

  • Universal prediction of individual sequences

    M. Feder;N. Merhav;M. Gutman

  • Relations between entropy and error probability

    M. Feder;N. Merhav

  • Fast algorithms for DCT-domain image downsampling and for inverse motion compensation

    N. Merhav;V. Bhaskaran

  • When is the generalized likelihood ratio test optimal

    O. Zeitouni;J. Ziv;N. Merhav

  • A measure of relative entropy between individual sequences with application to universal classification

    J. Ziv;N. Merhav

  • A competitive minimax approach to robust estimation of random parameters

    Y.C. Eldar;N. Merhav

  • Guessing subject to distortion

    E. Arikan;N. Merhav

  • On successive refinement for the Wyner-Ziv problem

    Y. Steinberg;N. Merhav

  • Channel Coding in the Presence of Side Information

    Guy Keshet;Yossef Steinberg;Neri Merhav

  • On the estimation of the order of a Markov chain and universal data compression

    N. Merhav;M. Gutman;J. Ziv

  • The Shannon cipher system with a guessing wiretapper

    N. Merhav;E. Arikan

  • Universal schemes for sequential decision from individual data sequences

    N. Merhav;M. Feder

  • Optimal sequential probability assignment for individual sequences

    M.J. Weinberger;N. Merhav;M. Feder

  • A strong version of the redundancy-capacity theorem of universal coding

    N. Merhav;M. Feder

  • Optimal prefix codes for sources with two-sided geometric distributions

    N. Merhav;G. Seroussi;M.J. Weinberger

  • Identification in the presence of side information with application to watermarking

    Y. Steinberg;N. Merhav

  • Low complexity sequential lossless coding for piecewise stationary memoryless sources

    G.I. Shamir;N. Merhav

Frequent Co-Authors

Tsachy Weissman
Tsachy Weissman Stanford University
Meir Feder
Meir Feder Tel Aviv University
Jacob Ziv
Jacob Ziv Technion – Israel Institute of Technology
Gadiel Seroussi
Gadiel Seroussi University of the Republic
Mauro Barni
Mauro Barni University of Siena
Shlomo Shamai
Shlomo Shamai Technion – Israel Institute of Technology
Igal Sason
Igal Sason Technion – Israel Institute of Technology
Wojciech Szpankowski
Wojciech Szpankowski Purdue University West Lafayette
Yonina C. Eldar
Yonina C. Eldar Weizmann Institute of Science

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing Computer Science in the USA opens doors to a variety of related degree and career options, many of which can be completed online. If affordability is a priority, check out the most affordable bachelor's degree online for a cost-effective start to your academic journey.

Those interested in technical fields often explore engineering schools online, which offer flexible pathways to careers in software, hardware, and systems engineering. If you’re considering career advancement or a pivot into management, an online executive MBA can strengthen your leadership skills and business acumen.

Another promising area is information management. For those drawn to data organization and digital resources, a library sciences degree can be completed online and lead to roles in digital archives, museums, or academic institutions.

These diverse programs provide flexible, affordable ways to specialize and advance within the broad world of technology and information sciences.

Best Scientists Citing Neri Merhav

Trending Scientists