Shannon Theory: Joint SourceChannel coding, Data Processing Bounds,
Guesswork, Secrecy, Mismatched Decoding, and Others
Joint SourceChannel Coding

E. Arikan and N. Merhav,
``Joint sourcechannel coding and
guessing with application to sequential decoding,''
IEEE Trans. Inform. Theory, vol. 44, no. 5, pp. 17561769,
September 1998.

N. Merhav and S. Shamai (Shitz),
``On joint sourcechannel coding for the WynerZiv source
and the Gel'fandPinsker channel,''
IEEE Trans. Inform.
Theory, vol. 49, no. 11, pp. 28442855, November 2003.

N. Merhav,
``On joint coding for watermarking and encryption,''
IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 190205, January
2006.

Y. Steinberg and N. Merhav,
``On hierarchical joint sourcechannel coding with degraded side
information,''
IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 886903, March 2006.

A. Maor and N. Merhav,
``Twoway successively refined
joint sourcechannel coding with a fidelity criterion,''
IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 14831494, April 2006.

N. Merhav,
``The random energy model in
a magnetic field and joint sourcechannel coding,''
Physica A: Statistical
Mechanics and its Applications , vol. 387, issue 22,
pp. 56625674, September 15, 2008.

N. Merhav,
``Joint sourcechannel coding via statistical mechanics: thermal
equilibrium between the source and the channel,''
IEEE Trans. Inform. Theory, vol. 55, no. 12, pp. 53825393, December 2009.

N. Merhav,
``Finitestate sourcechannel coding for individual source sequences with source
side information at the decoder,''
submitted to IEEE Trans. Inform. Theory, September 2021.
Data Processing Bounds

N. Merhav,
``Data processing theorems and the second law of thermodynamics,''
IEEE Trans. on Inform. Theory, vol. 57, no. 8, pp. 49264939, August
2011.

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. 52875301, August
2012.

N. Merhav,
``On the data processing theorem in the semideterministic setting,''
IEEE Trans. Inform. Theory,
vol. 60, no. 10, pp. 60326040, October 2014.

N. Merhav,
``Finitestate sourcechannel coding for individual source sequences with source
side information at the decoder,''
submitted to IEEE Trans. Inform. Theory, September 2021.
Guesswork

E. Arikan and N. Merhav,
``Guessing subject to distortion,''
IEEE Trans. Inform. Theory, vol. 44,
no. 3, pp. 10411056, May 1998.

E. Arikan and N. Merhav,
``Joint sourcechannel coding and
guessing with application to sequential decoding,''
IEEE Trans. Inform. Theory, vol. 44, no. 5, pp. 17561769,
September 1998.

N. Merhav, R. M. Roth, and E. Arikan,
``Hierarchical guessing with a
fidelity criterion,''
IEEE Trans. Inform. Theory, vol. 45,
no. 1, pp. 330337, January 1999.

N. Merhav and E. Arikan,
``The Shannon
cipher system with a guessing wiretapper,''
IEEE Trans. Inform. Theory, vol. 45,
no. 6, pp. 18601866, September 1999.

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.

N. Merhav,
``Noisy guesses, IEEE Trans. Inform. Theory,
vol. 66, no. 8, pp. 47964803, August 2020.

R. Graczyk, A. Lapidoth, N. Merhav, and C. Pfister,
``Guessing based on
compressed side information,'' submittted to IEEE Trans. Inform.
Theory,, June 2021.

A. Cohen and N. Merhav,
``Universal randomized guessing subjected to distortion,''
submitted to IEEE Trans. Inform.
Theory,, December 2021.
Secrecy

N. Merhav and E. Arikan,
``The Shannon
cipher system with a guessing wiretapper,''
IEEE Trans. Inform. Theory, vol. 45,
no. 6, pp. 18601866, September 1999.

N. Merhav,
``A largedeviations notion of perfect secrecy,''
IEEE Trans. Inform. Theory,
vol. 49, no. 2, pp. 506508, February 2003.

N. Merhav,
``On joint coding for watermarking and encryption,''
IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 190205, January
2006.

N. Merhav,
``On the Shannon cipher system with a capacitylimited keydistribution
channel,'' IEEE Trans. Inform. Theory, vol. 52, no. 3, pp.
12691273, March 2006.

N. Merhav and S. Shamai (Shitz),
``Information rates subjected to state masking,''
IEEE Trans. Inform. Theory, vol. 53, no. 6, pp. 22542261, June
2007.

N. Merhav,
``Shannon's secrecy system with informed receivers an its application to
systematic coding for wiretapped channels,''
IEEE Trans. Inform. Theory,
special issue on InformationTheoretic Security,
vol. 54, no. 6, pp. 27232734, June 2008.

N. Merhav,
``Perfectly secure encryption of individual sequences,''
IEEE Trans. Inform. Theory, vol. 58, no. 3, pp. 13021310, March
2013.

Y. Kaspi and N. Merhav,
``On realtime and causal secure source coding,''
Proc. ISIT 2012, pp. 358362, Cambridge, MA, USA, July 2012.
Full version (with a slightly different title) appears
here.

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

N. Weinberger and N. Merhav,
``A large deviations approach to secure lossy compression,''
IEEE Trans. Inform. Theory. vol. 63, no. 4, pp. 25332559, April
2017.

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,
``Ensemble performance of biometric authentication systems based on secret
key generation,'' IEEE Trans. Inform. Theory,
vol. 65, no. 4, pp. 24772491, April 2019.

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,
``Encoding individual source sequences for the wiretap channel.''
Entropy, 23(12) 1694, December 17, 2021.

S. Loyka and N. Merhav,
``The secrecy capacity of the Gaussian wiretap channel with ratelimited
help,'' submitted for publication, September 2022.
Mismatched Decoding

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. 19531967, November
1994.

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. Merhav,
``The generalized likelihood decoder: random coding and expurgated
bounds,''
IEEE Trans. Inform. Theory, vol. 63, no. 6, pp. 50395051, August
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.

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,
``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,
``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.

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

M. Feder and N. Merhav,
``Relations between
entropy and error probability,''
IEEE Trans. Inform. Theory, vol. 40, no. 1, pp. 259266, January
1994.

N. Merhav,
``How many information bits does
a decoder need about the channel statistics?''
IEEE Trans. Inform. Theory, vol.
43, no. 5, pp. 17071714, September 1997.

N. Merhav,
``On the Shannon cipher system with a capacitylimited keydistribution
channel,'' IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 12691273, March 2006.

T. Weissman and N. Merhav,
``Coding for the feedback Gel'fandPinsker channel and the feedforward
WynerZiv source,'' IEEE Trans.
Inform. Theory, vol. 52, no. 9, pp. 42074211,
September 2006.

A. Maor and N. Merhav,
``On successive refinement with causal side information at the decoders,''
IEEE Trans. Inform. Theory,
vol. 54, no. 1, pp. 332343, January 2008.

A. Maor and N. Merhav,
``On successive refinement for the Kaspi/HeegardBerger problem,''
IEEE Trans. Inform. Theory}, vol. 56, no. 8, pp. 39303945, August
2010.

N. Merhav,
``Physics of the Shannon limits,''
IEEE Trans. Inform. Theory, vol. 56, no. 9, pp. 42744285,
September 2010.
Short version 
in Proc. 2009 IEEE Workshop on Information
Theory (ITW 2009),
Taormina, Sicily, Italy, October 2009.

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.

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. 57275744,
October 2015.

W. Huleihel and N. Merhav,
``Codewords with memory improve achievable rate regions of the Gaussian
memoryless interference channel,''
unpublished 2015.

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