Lossless Source Coding

N. Merhav,
``Universal coding with
minimum probability of code word length
overflow,''
IEEE Trans. Inform. Theory
vol. 37, no. 3, pp. 556563, May 1991.

N. Merhav and D. L. Neuhoff,
``Variabletofixed length codes provide
better large deviations performance than fixedtovariable length codes,''
IEEE Trans. Inform. Theory,
vol. 38, no. 1, pp. 135140, January 1992.

N. Merhav,
``On the minimum description length principle for sources with
piecewise constant parameters,''
IEEE Trans. Inform. Theory,
vol. 39, no. 6, pp. 19621967, November 1993.

M. J. Weinberger, N. Merhav, and M. Feder,
``Optimal sequential probability
assignment for individual sequences,''
IEEE Trans. Inform. Theory
vol. 40, no. 2, pp. 384396, March 1994.

N. Merhav,
``Bounds on achievable convergence rates of
parameter estimators via universal coding,''
IEEE Trans. Inform. Theory, vol. 40, no. 4, pp. 12101215, July 1994.

N. Merhav and M. Feder,
``A strong version of
the redundancycapacity theorem of universal coding,''
IEEE Trans. Inform. Theory, vol. 41, no. 3, pp. 714722, May 1995.

M. Feder and N. Merhav,
``Universal coding for arbitrarily varying sources,''
Proc. 1995 IEEE Int. Symp. on Information Theory, (ISIT `95), p. 16,
Whistler, British Columbia, Canada, September 1995.

M. Feder and N. Merhav,
``Hierarchical universal coding,''
IEEE Trans. Inform. Theory, vol. 42, no. 5,
pp. 13541364, September 1996.

G. I. Shamir and N. Merhav,
``Lowcomplexity sequential lossless coding for piecewise
stationary memoryless sources,''
IEEE Trans. Inform. Theory,
vol. 45, no. 5, pp. 14981519, July 1999.

N. Merhav, G. Seroussi, and M. J. Weinberger,
``Optimal prefix codes for
sources with twosided geometric distributions,''
IEEE Trans. Inform. Theory, vol. 46, no. 1,
pp. 121135, January 2000.

N. Merhav, G. Seroussi, and M. J. Weinberger,
``Coding of sources with twosided geometric distributions
and unknown parameters,''
IEEE Trans. Inform. Theory, vol. 46, no. 1,
pp. 229236, January 2000.

N. Merhav,
``Relations between redundancy patterns of the Shannon code and
wave diffraction patterns of partially disordered media,''
IEEE Trans. Inform. Theory, vol. 58, no. 6, pp. 34023406,
June 2012.

N. Merhav,
``2SSubsetsum phase transitions and data compression,''
Journal of Statistical Mechanics: Theory and Experiment,
P09017, September 2011,
doi: 10.1088/17425468/2011/09/P01029

N. Merhav and W. Szpankowsi,
``Average redundancy of the Shannon code for Markov sources,''
IEEE Trans. Inform. Theory, vol. 59, no. 11, pp. 71867193,
November 2013.

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

N. Merhav,
``Asymptotically optimal decision rules for joint detection and source
coding,''
IEEE Trans. Inform. Theory,
vol. 60, no. 11, pp. 67876795, November 2014.

Y. Kaspi and N. Merhav,
``Zerodelay and causal secure source coding,''
IEEE Trans. Inform. Theory, vol. 61, no. 11, pp. 62386250, November
2015.

N. Weinberger and N. Merhav,
``Large deviations analysis 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.

N. Merhav,
``On empirical cumulant generating functions of code lengths for individual
sequences,''
IEEE Trans. Inform. Theory,
vol. 63, no. 12, pp. 77297736, December 2017.

N. Merhav and A. Cohen,
``Universal randomized guessing with application to
asynchronous decentralized bruteforce attacks,''
IEEE Trans. Inform. Theory,
vol. 66, no. 1, pp. 114129, January 2020.

N. Merhav,
``Guessing individual sequences: generating randomized guesses using
finitestate machines,'' IEEE Trans. Inform.
Theory,
Journal of Statistical Mechanics: Theory and Experiment,
P09017, September 2011,
doi: 10.1088/17425468/2011/09/P01029

N. Merhav and W. Szpankowsi,
``Average redundancy of the Shannon code for Markov sources,''
IEEE Trans. Inform. Theory, vol. 59, no. 11, pp. 71867193,
November 2013.

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

N. Merhav,
``Asymptotically optimal decision rules for joint detection and source
coding,''
IEEE Trans. Inform. Theory,
vol. 60, no. 11, pp. 67876795, November 2014.

Y. Kaspi and N. Merhav,
``Zerodelay and causal secure source coding,''
IEEE Trans. Inform. Theory, vol. 61, no. 11, pp. 62386250, November
2015.

N. Weinberger and N. Merhav,
``Large deviations analysis 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.

N. Merhav,
``On empirical cumulant generating functions of code lengths for individual
sequences,''
IEEE Trans. Inform. Theory,
vol. 63, no. 12, pp. 77297736, December 2017.

N. Merhav and A. Cohen,
``Universal randomized guessing with application to
asynchronous decentralized bruteforce attacks,''
IEEE Trans. Inform. Theory,
vol. 66, no. 1, pp. 114129, January 2020.

N. Merhav,
``Guessing individual sequences: generating randomized guesses using
finitestate machines,'' IEEE Trans. Inform.
Theory, vol. 66, no. 5, pp. 29122920, May 2020.

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.

N. Merhav,
``Universal SlepianWolf coding for individual sequences,''
submitted for publication, March 2024.