Tutorials and Others

Tutorials
  1. N. Merhav and M. Feder, ``Universal prediction,'' (invited paper) IEEE Trans. Inform. Theory, vol. 44, no. 6, pp. 2124-2147, October 1998. (Commemorative issue for fifty years of Information Theory.) Also, in Information Theory: 50 Years of Discovery, pp. 80-103, Eds. S. Verdu and S. McLaughlin, IEEE Press, 1999.
  2. Y. Ephraim and N. Merhav, ``Hidden Markov processes,'' (invited paper) IEEE Trans. Inform. Theory, special issue in memory of Aaron D. Wyner, vol. 48, no. 6, pp. 1518-1569, June 2002. Downloadable from Yariv Ephraim's web-page.
  3. G. Keshet, Y. Steinberg, and N. Merhav, ``Channel coding in the presence of side information,'' Foundations and Trends in Communications and Information Theory, vol. 4, issue 6, 2007.
  4. N. Merhav, ``Statistical physics and information theory,'' Foundations and Trends in Communications and Information Theory, vol. 6, nos. 1-2, pp. 1-212, 2009.
Others
  1. N. Merhav, ``On optimum strategies for minimizing exponential moments of a given cost function,'' Communications in Information and Systems, vol. 11, no. 4, pp. 343-368, 2011.
  2. N. Merhav and I. Sason, ``An integral representation of the logarithmic function with applications in information theory,'' Entropy 2020, 22(1), 51; https://doi.org/10.3390/e22010051 published on December 30, 2019.
  3. N. Merhav and I. Sason, ``Some useful integral representations for information-theoretic analyses,'' Entropy 2020, 22(6), 707; https://doi.org/10.3390/e22060707 published on June 26, 2020.
  4. N. Merhav, ``Reversing Jensen's inequality for information-theoretic analyses,'' Information 2022, 13(1), 39; https://doi.org/10.3390/info13010039