Exponential Error Bounds and Reliability Functions of Source Coding and Channel Coding

Source Coding Error Exponents
  1. T. Weissman and N. Merhav, ``Tradeoffs between the excess code-length exponent and the excess distortion exponent in lossy source coding,'' IEEE Trans. Inform. Theory, vol. 48, no. 2, pp. 396-415, February 2002.
  2. N. Merhav and I. Kontoyiannis, ``Source coding exponents for zero-delay coding with finite memory,'' IEEE Trans. Inform. Theory, vol. 49, no. 3, pp. 609-625, March 2003.
  3. I. Hen and N. Merhav, ``On the error exponent of trellis source coding,'' IEEE Trans. Inform. Theory, vol. 51, no. 11, pp. 3734-3741, November 2005.
  4. N. Merhav, ``Erasure/list exponents for Slepian-Wolf decoding,'' IEEE Trans. Inform. Theory, vol. 60, no. 8, pp. 4463-4471, August 2014.
  5. N. Weinberger and N. Merhav, `Optimum tradeoffs between the error exponent and the excess--rate exponent of variable--rate Slepian-Wolf coding,'' IEEE Trans. Inform. Theory, vol. 61, no. 4, pp. 2165-2190, April 2015.
  6. N. Merhav, ``Statistical physics of random binning,'' IEEE Trans. Inform. Theory, vol. 61, no. 5, pp. 2454-2464, May 2015.
  7. R. Tamir (Averbuch) and N. Merhav, ``Trade-offs between error exponents and excess-rate exponents of typical Slepian-Wolf codes, Entropy 23, 265. https://doi.org/10.3390/e23030265 February 2021.
  8. N. Merhav, ``Universal decoding for asynchronous Slepian-Wolf encoding,'' IEEE Trans. Inform. Theory, vol. 67, no. 5, pp. 2652-2662, May 2021.
  9. N. Merhav, ``On more general distributions of random binning for Slepian-Wolf encoding,'' IEEE Trans. Inform. Theory, vol. 68, no. 2, pp. 737-751, February 2022.
Channel Coding Error Exponents
  1. N. Merhav, ``On random coding error exponents of watermarking systems,'' IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 420-430, March 2000.
  2. A. Somekh-Baruch and N. Merhav, ``On the error exponent and capacity games of private watermarking systems,'' IEEE Trans. Inform. Theory, vol. 49, no. 3, pp. 537-562, March 2003.
  3. A. Cohen and N. Merhav, ``Lower bounds on the error probability of block codes based on improvements on de Caen's inequality,'' IEEE Trans. Inform. Theory, vol. 50, no. 2, pp. 290-310, February 2004.
  4. A. Somekh-Baruch and N. Merhav, ``Achievable error exponents for the private fingerprinting game,'' in IEEE Trans. Inform. Theory, vol. 53, no. 5, pp. 1827-1838, May 2007.
  5. 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.
  6. 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.
  7. Y. Akirav and N. Merhav, ``Competitive minimax universal decoding for several ensembles of random codes,'' submitted to IEEE Trans. Inform. Theory, July 2007.
  8. A. Somekh-Baruch and N. Merhav, ``On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channels,'' Proc. ISIT 2004, p. 448, Chicago, IL, June-July, 2004.
  9. R. Etkin, N. Merhav, and E. Ordentlich, ``Error exponents of optimum decoding for the interference channel,'' in Proc. ISIT 2008, Toronto, Canada, July 2008. The full journal paper is here.
  10. Y. Kaspi and N. Merhav, ``Error exponents for degraded broadcast channels with degraded message sets,'' in Proc. ISIT 2008, Toronto, Canada, July 2008.
  11. N. Merhav, ``Error exponents of erasure/list decoding revisited via moments of distance enumerators,'' IEEE Trans. Inform. Theory, , vol. 54, no. 10, pp. 4439-4447, October 2008.
  12. Y. Kaspi and N. Merhav, ``Error exponents of optimum decoding for the degraded broadcast channel using moments of type-class enumerators,'' in Proc. ISIT 2009, Seoul, Korea, June-July 2009.
  13. E. Sabbag and N. Merhav, ``Achievable error exponents for channels with side information - erasure and list decoding,'' IEEE Trans. Inform. Theory, vol. 56, no. 11, pp. 5424-5431, November 2010.
  14. A. Somekh-Baruch and N. Merhav, ``Exact random coding exponents for erasure decoding,'' Proc. ISIT 2010, Austin, Texas, U.S.A., June 2010. The full version is in IEEE Trans. Inform. Theory, vol. 57, no. 10, pp. 6444-6454, October 2011.
  15. Y. Kaspi and N. Merhav, ``Revisiting Gallager's error exponent analysis technique,'' 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel (IEEEI), Eilat, Israel, November 2010. [Received the Best Student Paper Award in the category of Information Theory.]
  16. 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.
  17. E. Sabbag and N. Merhav, ``Error exponents of optimum erasure/list and ordinary decoding for channels with side information, Proc. ISIT 2012, pp. 2949-2953, Cambridge, MA, U.S.A., July 2012.
  18. N. Merhav, ``Another look at expurgated bounds and their statistical-mechanical interpretation,'' unpublished.
  19. J. Scarlett, L. Peng, N. Merhav, A. Martinez, and A. G. i Fabregas, ``Expurgated random-coding ensembles: exponents, refinements and connections,'' IEEE Trans. Inform. Theory, vol. 60, no. 8, pp. 4449-4462, August 2014.
  20. N. Weinberger and N. Merhav, ``Codeword or noise? Exact random coding exponents for joint detection and decoding,'' IEEE Trans. Inform. Theory, vol. 60, no. 9, pp. 5077-5094, September 2014.
  21. N. Merhav, ``Exact random coding error exponents of optimal bin index decoding,'' IEEE Trans. Inform. Theory, vol. 60, no. 10, pp. 6024-6031, October 2014.
  22. N. Merhav, ``List decoding - random coding exponents and expurgated exponents,'' IEEE Trans. Inform. Theory, vol. 60, no. 11, pp. 6749-6759, November 2014.
  23. N. Merhav, ``Exact correct-decoding exponent for the wiretap channel decoder,'' IEEE Trans. Inform. Theory, vol. 60, no. 12, pp. 7606-7615, December 2014.
  24. N. Merhav, ``On zero-rate error exponents of finite-state channels with input-dependent states,'' IEEE Trans. Inform. Theory, vol. 61, no. 2, pp. 741-750, February 2015.
  25. N. Weinberger and N. Merhav, ``Simplified erasure/list decoding,'' IEEE Trans. Inform. Theory, vol. 63, no. 7, pp. 4218-4239, July 2017.
  26. R. Atar and N. Merhav, ``Information-theoretic applications of the logarithmic probability comparison bound,'' IEEE Trans. Inform. Theory, vol. 61, no. 10, pp. 5366-5386, October 2015.
  27. W. Huleihel and N. Merhav, ``Exact random coding error exponents for the two-user interference channel,'' IEEE Trans. Inform. Theory, vol. 63, no. 2, pp. 1019-1042, February 2017.
  28. N. Merhav, ``Universal decoding for source-channel coding with side information,'' Communications in Information and Systems, vol. 16, no. 1, pp. 17-58, 2016.
  29. N. Weinberger and N. Merhav, ``Channel detection in coded communication,'' IEEE Trans. Inform. Theory, vol. 63, no. 10, pp. 6364-6392, October 2017.
  30. N. Merhav, ``The generalized likelihood decoder: random coding and expurgated bounds,'' IEEE Trans. Inform. Theory, vol. 63, no. 6, pp. 5039-5051, August 2017. See also this correction note.
  31. M. Bastani Parizi, E. Telatar and N. Merhav, ``Exact random coding secrecy exponents for the wiretap channel, IEEE Trans. Inform. Theory. vol. 63, no. 1, pp. 509-531, January 2017.
  32. N. Merhav, ``Reliability of universal decoding based on vector-quantized codewords,'' IEEE Trans. Inform. Theory, vol. 63, no. 5, pp. 2696-2709, May 2017.
  33. R. Averbuch and N. Merhav, ``Exact random coding exponents and universal decoders for the asymmetric broadcast channel,'' IEEE Trans. Inform. Theory, vol. 64, no. 7, pp. 5070-5086, July 2018.
  34. W. Huleihel, S. Salamtian, N. Merhav, and M. Medard, ``Gaussian intersymbol inteference channels with mismatch,'' IEEE Trans. Inform. Theory, vol. 65, no. 7, pp. 4499-4517, July 2019.
  35. N. Merhav, ``Ensemble performance of biometric authentication systems based on secret key generation,'' IEEE Trans. Inform. Theory, vol. 65, no. 4, pp. 2477-2491, April 2019.
  36. S. Ginzach, N. Merhav, and I. Sason, ``Random coding error exponent of variable-length codes with a single-bit noiseless feedback,'' Proc. ITW 2017, Taiwan, November 2017.
  37. N. Merhav, ``Error exponents of typical random codes,'' IEEE Trans. Inform. Theory, vol. 64, no. 9, pp. 6223-6235, September 2018.
  38. R. Averbuch, N. Weinberger and N. Merhav, ``Expurgated bounds for the asymmetric broadcast channel,'' IEEE Trans. Inform. Theory, vol. 65, no. 6, pp. 3412-3435, June 2019.
  39. N. Merhav, ``False-accept/false-reject trade-offs in biometric authentication systems,'' IEEE Trans. Inform. Theory, vol. 65, no. 8, pp. 4997-5006, August 2019.
  40. N. Merhav, ``Error exponents of typical random codes for the colored Gaussian channel,'' IEEE Trans. Inform. Theory, vol. 65, no. 12, pp. 8164-8179, December 2019.
  41. N. Merhav, ``Error exponents of typical random trellis codes,'' IEEE Trans. Inform. Theory, vol. 66, no. 4, pp, 2067-2077, April 2020.
  42. N. Merhav, ``A Lagrange-dual lower bound to the error exponent of the typical random code,'' IEEE Trans. Inform. Theory, vol. 66, no. 6, pp. 3456-3464, June 2020.
  43. R. Tamir (Averbuch), N. Merhav, N. Weinberger, and A. Guillen i. Fabregas, ``Large deviations behavior of the logarithmic error probability of random codes,'' IEEE Trans. Inform. Theory, vol. 66, no. 11, pp. 6635-6659, November 2020
  44. R. Tamir (Averbuch) and N. Merhav, ``Universal decoding for the typical random code and for the expurgated code,'' accepted to IEEE Trans. Inform. Theory, December 2021.
  45. R. Tamir (Averbuch) and N. Merhav, ``Error exponents in the bee identification problem,'' IEEE Trans. Inform. Theory, vol. 67, no. 10, pp. 6564-6582, October 2021.
  46. N. Merhav, ``On error exponents of encoder-assisted communication systems,'' IEEE Trans. Inform. Theory, vol. 67, no. 11, pp. 7019-7029, November 2021.
  47. N . Weinberger and N. Merhav, ``The DNA-storage channel: capacity and error probability bounds,'' submitted for publication, August 2021.
  48. R. Tamir and N. Merhav, ``Error exponents of the dirty paper and Gel'fand-Pinsker channels,'' submitted for publication, May 2022.
  49. N. Merhav and G. Bocherer, ``Codebook mismatch can be fully compensated by mismatched decoding,'' submitted for publication, June 2022.