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

T. Weissman and N. Merhav,
``Tradeoffs between the excess codelength exponent
and the excess distortion exponent in lossy source coding,''
IEEE Trans. Inform. Theory, vol.
48, no. 2, pp. 396415, February 2002.

N. Merhav and I. Kontoyiannis,
``Source coding exponents for zerodelay coding with finite memory,''
IEEE Trans. Inform. Theory, vol. 49, no. 3, pp. 609625, March 2003.

I. Hen and N. Merhav,
``On the error exponent of trellis source coding,''
IEEE Trans. Inform. Theory, vol. 51, no. 11, pp. 37343741,
November 2005.

N. Merhav,
``Erasure/list exponents for SlepianWolf decoding,''
IEEE Trans. Inform. Theory, vol. 60, no. 8, pp. 44634471, August
2014.

N. Weinberger and N. Merhav,
`Optimum tradeoffs between the error
exponent and the excessrate exponent of
variablerate SlepianWolf coding,''
IEEE Trans. Inform. Theory,
vol. 61, no. 4, pp. 21652190, April 2015.

N. Merhav,
``Statistical physics of random binning,''
IEEE Trans. Inform. Theory,
vol. 61, no. 5, pp. 24542464, May 2015.

R. Tamir (Averbuch) and N. Merhav,
``Tradeoffs between error exponents and excessrate exponents of typical
SlepianWolf codes,
Entropy 23, 265. https://doi.org/10.3390/e23030265 February 2021.

N. Merhav,
``Universal decoding for asynchronous SlepianWolf encoding,''
IEEE Trans. Inform. Theory,
vol. 67, no. 5, pp. 26522662, May 2021.

N. Merhav,
``On more general distributions of random binning for SlepianWolf
encoding,''
IEEE Trans. Inform. Theory,
vol. 68, no. 2, pp. 737751, February 2022.
Channel Coding Error Exponents

N. Merhav,
``On random coding error exponents of watermarking systems,''
IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 420430, March 2000.

A. SomekhBaruch and N. Merhav,
``On the error exponent and capacity
games of private watermarking systems,''
IEEE Trans. Inform. Theory, vol. 49, no. 3, pp. 537562, March 2003.

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. 290310, February 2004.

A. SomekhBaruch and N. Merhav,
``Achievable error exponents for the private fingerprinting game,''
in IEEE Trans. Inform.
Theory, vol. 53, no. 5, pp. 18271838, May 2007.

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. 15041517, June 2002.

N. Merhav and M. Feder,
``Minimax universal decoding with an erasure option,''
IEEE Trans. Inform. Theory, vol. 53, no. 5, pp. 16641675, May 2007.

Y. Akirav and N. Merhav,
``Competitive minimax universal decoding for several ensembles of
random codes,'' submitted to
IEEE Trans. Inform. Theory, July 2007.

A. SomekhBaruch and N. Merhav,
``On the random coding error exponents of the singleuser and the
multipleaccess Gel'fandPinsker channels,''
Proc. ISIT 2004, p. 448, Chicago, IL, JuneJuly, 2004.

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.

Y. Kaspi and N. Merhav,
``Error exponents for degraded broadcast channels with degraded message
sets,''
in Proc. ISIT 2008, Toronto, Canada, July 2008.

N. Merhav,
``Error exponents of erasure/list decoding
revisited via moments of distance enumerators,''
IEEE Trans. Inform. Theory, ,
vol. 54, no. 10,
pp. 44394447, October 2008.

Y. Kaspi and N. Merhav,
``Error exponents of optimum decoding for the
degraded broadcast channel using moments of typeclass enumerators,''
in Proc. ISIT 2009, Seoul, Korea, JuneJuly 2009.

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. 54245431, November 2010.

A. SomekhBaruch 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. 64446454, October 2011.

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.]

N. Merhav,
``On optimum strategies for minimizing exponential moments of a given cost
function,'' Communications in Information
and Systems, vol. 11, no. 4, pp. 343368, 2011.

E. Sabbag and N. Merhav,
``Error exponents of optimum erasure/list and ordinary decoding for channels
with side information, Proc. ISIT 2012, pp. 29492953, Cambridge, MA,
U.S.A., July 2012.

N. Merhav,
``Another look at expurgated bounds and their statisticalmechanical
interpretation,'' unpublished.

J. Scarlett, L. Peng, N. Merhav, A. Martinez, and A. G. i Fabregas,
``Expurgated randomcoding ensembles: exponents, refinements and
connections,'' IEEE Trans. Inform. Theory, vol. 60, no. 8, pp.
44494462, August 2014.

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. 50775094, September 2014.

N. Merhav,
``Exact random coding error exponents of optimal bin index decoding,''
IEEE Trans. Inform. Theory,
vol. 60, no. 10, pp. 60246031, October 2014.

N. Merhav,
``List decoding  random coding exponents and expurgated exponents,''
IEEE Trans. Inform. Theory,
vol. 60, no. 11, pp. 67496759, November 2014.

N. Merhav,
``Exact correctdecoding exponent for the wiretap channel decoder,''
IEEE Trans. Inform. Theory, vol. 60, no. 12, pp. 76067615, December
2014.

N. Merhav,
``On zerorate error exponents of finitestate channels with inputdependent
states,''
IEEE Trans. Inform. Theory,
vol. 61, no. 2, pp. 741750, February 2015.

N. Weinberger and N. Merhav,
``Simplified erasure/list decoding,''
IEEE Trans. Inform. Theory,
vol. 63, no. 7, pp. 42184239, July 2017.

R. Atar and N. Merhav,
``Informationtheoretic applications of the logarithmic
probability comparison bound,'' IEEE Trans. Inform. Theory,
vol. 61, no. 10, pp. 53665386, October 2015.

W. Huleihel and N. Merhav,
``Exact random coding error exponents for the twouser interference
channel,''
IEEE Trans. Inform. Theory, vol. 63, no. 2, pp. 10191042,
February 2017.

N. Merhav,
``Universal decoding for sourcechannel coding with side information,''
Communications in Information and Systems,
vol. 16, no. 1, pp. 1758, 2016.

N. Weinberger and N. Merhav,
``Channel detection in coded communication,''
IEEE Trans. Inform. Theory, vol. 63, no. 10,
pp. 63646392, October 2017.

N. Merhav,
``The generalized likelihood decoder: random coding and expurgated
bounds,''
IEEE Trans. Inform. Theory, vol. 63, no. 6, pp. 50395051, August 2017.
See also
this correction note.

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. 509531,
January 2017.

N. Merhav,
``Reliability of universal decoding based on vectorquantized codewords,''
IEEE Trans. Inform. Theory, vol. 63, no. 5,
pp. 26962709, May 2017.

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. 50705086, July 2018.

W. Huleihel, S. Salamtian, N. Merhav, and M. Medard,
``Gaussian intersymbol inteference channels with mismatch,''
IEEE Trans. Inform. Theory,
vol. 65, no. 7, pp. 44994517, July 2019.

N. Merhav,
``Ensemble performance of biometric authentication systems based on secret
key generation,'' IEEE Trans. Inform. Theory,
vol. 65, no. 4, pp. 24772491, April 2019.

S. Ginzach, N. Merhav, and I. Sason,
``Random coding error exponent of variablelength codes with a singlebit
noiseless feedback,''
Proc. ITW 2017, Taiwan, November
2017.
 N. Merhav,
``Error exponents of typical random codes,''
IEEE Trans. Inform. Theory,
vol. 64, no. 9, pp. 62236235,
September 2018.

R. Averbuch, N. Weinberger and N. Merhav,
``Expurgated bounds for the asymmetric broadcast channel,''
IEEE Trans. Inform. Theory,
vol. 65, no. 6, pp. 34123435, June 2019.

N. Merhav,
``Falseaccept/falsereject tradeoffs in
biometric authentication systems,''
IEEE Trans. Inform. Theory, vol. 65, no.
8, pp. 49975006, August 2019.

N. Merhav,
``Error exponents of typical random codes for the colored Gaussian
channel,''
IEEE Trans. Inform. Theory,
vol. 65, no. 12, pp. 81648179,
December 2019.

N. Merhav,
``Error exponents of typical random trellis codes,''
IEEE Trans. Inform. Theory, vol. 66, no. 4, pp, 20672077, April 2020.

N. Merhav,
``A Lagrangedual lower bound to the error exponent of the typical random
code,''
IEEE Trans. Inform. Theory, vol. 66, no. 6, pp. 34563464, June 2020.

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. 66356659, November 2020

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.

R. Tamir (Averbuch) and N. Merhav,
``Error exponents in the bee identification problem,''
IEEE Trans. Inform. Theory, vol. 67, no. 10,
pp. 65646582, October 2021.

N. Merhav,
``On error exponents of encoderassisted communication systems,''
IEEE Trans. Inform. Theory, vol. 67, no. 11, pp. 70197029,
November 2021.

N
. Weinberger and N. Merhav,
``The DNAstorage channel: capacity and error probability bounds,''
submitted for publication, August 2021.

R. Tamir and N. Merhav,
``Error exponents of the dirty paper and Gel'fandPinsker channels,''
submitted for publication, May 2022.

N. Merhav and G. Bocherer,
``Codebook mismatch can be fully compensated by mismatched decoding,''
submitted for publication, June 2022.