Shannon Theory (General)

  1. M. Feder and N. Merhav, ``Relations between entropy and error probability,'' IEEE Trans. Inform. Theory, vol. 40, no. 1, pp. 259-266, January 1994.
  2. N. Merhav, G. Kaplan, A. Lapidoth, and S. Shamai (Shitz), ``On information rates for mismatched decoders,'' IEEE Trans. Inform. Theory, vol. 40, no. 6, pp. 1953-1967, November 1994.
  3. N. Merhav, ``How many information bits does a decoder need about the channel statistics?'' IEEE Trans. Inform. Theory, vol. 43, no. 5, pp. 1707-1714, September 1997.
  4. E. Arikan and N. Merhav, ``Joint source-channel coding and guessing with application to sequential decoding,'' IEEE Trans. Inform. Theory, vol. 44, no. 5, pp. 1756-1769, September 1998.
  5. N. Merhav and S. Shamai (Shitz), ``On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel,'' IEEE Trans. Inform. Theory, vol. 49, no. 11, pp. 2844-2855, November 2003.
  6. N. Merhav, ``On joint coding for watermarking and encryption,'' IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 190-205, January 2006.
  7. Y. Steinberg and N. Merhav, ``On hierarchical joint source-channel coding with degraded side information,'' IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 886-903, March 2006.
  8. N. Merhav, ``On the Shannon cipher system with a capacity-limited key-distribution channel,'' IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1269-1273, March 2006.
  9. A. Maor and N. Merhav, ``Two-way successively refined joint source-channel coding with a fidelity criterion,'' IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1483-1494, April 2006.
  10. T. Weissman and N. Merhav, ``Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source,'' IEEE Trans. Inform. Theory, vol. 52, no. 9, pp. 4207-4211, September 2006.
  11. A. Maor and N. Merhav, ``On successive refinement with causal side information at the decoders,'' IEEE Trans. Inform. Theory, vol. 54, no. 1, pp. 332-343, January 2008.
  12. N. Merhav, ``The random energy model in a magnetic field and joint source-channel coding,'' Physica A: Statistical Mechanics and its Applications , vol. 387, issue 22, pp. 5662-5674, September 15, 2008.
  13. N. Merhav, ``Joint source-channel coding via statistical mechanics: thermal equilibrium between the source and the channel,'' IEEE Trans. Inform. Theory, vol. 55, no. 12, pp. 5382-5393, December 2009.
  14. A. Maor and N. Merhav, ``On successive refinement for the Kaspi/Heegard-Berger problem,'' IEEE Trans. Inform. Theory}, vol. 56, no. 8, pp. 3930--3945, August 2010.
  15. N. Merhav, ``Physics of the Shannon limits,'' IEEE Trans. Inform. Theory, vol. 56, no. 9, pp. 4274-4285, September 2010. Short version - in Proc. 2009 IEEE Workshop on Information Theory (ITW 2009), Taormina, Sicily, Italy, October 2009.
  16. N. Merhav, ``Data processing theorems and the second law of thermodynamics,'' IEEE Trans. on Inform. Theory, vol. 57, no. 8, pp. 4926-4939, August 2011.
  17. 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.
  18. N. Merhav, ``Data processing inequalities based on a certain structured class of information measures with application to estimation theory,'' IEEE Trans. Inform. Theory, vol. 58, no. 8, pp. 5287-5301, August 2012.
  19. N. Merhav, ``On the data processing theorem in the semi-deterministic setting,'' IEEE Trans. Inform. Theory, vol. 60, no. 10, pp. 6032-6040, October 2014.
  20. W. Huleihel, N. Merhav and S. Shamai (Shitz), ``On compressive sensing in coding problems: a rigorous approach,'' IEEE Trans. Inform. Theory, vol. 61, no. 10, pp. 5727-5744, October 2015.
  21. W. Huleihel and N. Merhav, ``Codewords with memory improve achievable rate regions of the Gaussian memoryless interference channel,'' submitted to IEEE Trans. Inform. Theory, August 2015.
  22. W. Huleihel, S. Salamtian, N. Merhav, and M. Medard, ``Gaussian intersymbol inteference channels with mismatch,'' submitted to IEEE Trans. Inform. Theory, June 2017.