Shannon Theory: Joint Source-Channel coding, Data Processing Bounds, Guesswork, Secrecy, Mismatched Decoding, and Others

Joint Source-Channel Coding
  1. 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.
  2. 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.
  3. N. Merhav, ``On joint coding for watermarking and encryption,'' IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 190-205, January 2006.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. N. Merhav, ``Finite-state source-channel coding for individual source sequences with source side information at the decoder,'' submitted to IEEE Trans. Inform. Theory, September 2021.
Data Processing Bounds
  1. 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.
  2. 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.
  3. 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.
  4. N. Merhav, ``Finite-state source-channel coding for individual source sequences with source side information at the decoder,'' submitted to IEEE Trans. Inform. Theory, September 2021.
Guesswork
  1. E. Arikan and N. Merhav, ``Guessing subject to distortion,'' IEEE Trans. Inform. Theory, vol. 44, no. 3, pp. 1041-1056, May 1998.
  2. 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.
  3. N. Merhav, R. M. Roth, and E. Arikan, ``Hierarchical guessing with a fidelity criterion,'' IEEE Trans. Inform. Theory, vol. 45, no. 1, pp. 330-337, January 1999.
  4. N. Merhav and E. Arikan, ``The Shannon cipher system with a guessing wiretapper,'' IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 1860-1866, September 1999.
  5. N. Merhav and A. Cohen, ``Universal randomized guessing with application to asynchronous decentralized brute-force attacks,'' IEEE Trans. Inform. Theory, vol. 66, no. 1, pp. 114--129, January 2020.
  6. N. Merhav, ``Guessing individual sequences: generating randomized guesses using finite-state machines,'' IEEE Trans. Inform. Theory, vol. 66, no. 5, pp. 2912-2920, May 2020.
  7. N. Merhav, ``Noisy guesses, IEEE Trans. Inform. Theory, vol. 66, no. 8, pp. 4796-4803, August 2020.
  8. R. Graczyk, A. Lapidoth, N. Merhav, and C. Pfister, ``Guessing based on compressed side information,'' submittted to IEEE Trans. Inform. Theory,, June 2021.
  9. A. Cohen and N. Merhav, ``Universal randomized guessing subjected to distortion,'' submitted to IEEE Trans. Inform. Theory,, December 2021.
Secrecy
  1. N. Merhav and E. Arikan, ``The Shannon cipher system with a guessing wiretapper,'' IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 1860-1866, September 1999.
  2. N. Merhav, ``A large-deviations notion of perfect secrecy,'' IEEE Trans. Inform. Theory, vol. 49, no. 2, pp. 506-508, February 2003.
  3. N. Merhav, ``On joint coding for watermarking and encryption,'' IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 190-205, January 2006.
  4. 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.
  5. N. Merhav and S. Shamai (Shitz), ``Information rates subjected to state masking,'' IEEE Trans. Inform. Theory, vol. 53, no. 6, pp. 2254-2261, June 2007.
  6. 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 Information-Theoretic Security, vol. 54, no. 6, pp. 2723-2734, June 2008.
  7. N. Merhav, ``Perfectly secure encryption of individual sequences,'' IEEE Trans. Inform. Theory, vol. 58, no. 3, pp. 1302-1310, March 2013.
  8. Y. Kaspi and N. Merhav, ``On real-time and causal secure source coding,'' Proc. ISIT 2012, pp. 358-362, Cambridge, MA, USA, July 2012. Full version (with a slightly different title) appears here.
  9. N. Merhav, ``Exact correct-decoding exponent for the wiretap channel decoder, IEEE Trans. Inform. Theory. vol. 60, no. 12 pp. 7606-7615, December 2014.
  10. N. Weinberger and N. Merhav, ``A large deviations approach to secure lossy compression,'' IEEE Trans. Inform. Theory. vol. 63, no. 4, pp. 2533-2559, April 2017.
  11. 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.
  12. 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.
  13. N. Merhav and A. Cohen, ``Universal randomized guessing with application to asynchronous decentralized brute-force attacks,'' IEEE Trans. Inform. Theory, vol. 66, no. 1, pp. 114-129, January 2020.
  14. N. Merhav, ``Encoding individual source sequences for the wiretap channel.'' Entropy, 23(12) 1694, December 17, 2021.
  15. S. Loyka and N. Merhav, ``The secrecy capacity of the Gaussian wiretap channel with rate-limited help,'' submitted for publication, September 2022.
Mismatched Decoding
  1. 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.
  2. 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.
  3. N. Merhav, ``The generalized likelihood decoder: random coding and expurgated bounds,'' IEEE Trans. Inform. Theory, vol. 63, no. 6, pp. 5039-5051, August 2017.
  4. N. Merhav, ``Error exponents of typical random codes,'' IEEE Trans. Inform. Theory, vol. 64, no. 9, pp. 6223-6235, September 2018.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. N. Merhav and G. Bocherer, ``Codebook mismatch can be fully compensated by mismatched decoding,'' submitted for publication, June 2022.
Others
  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, ``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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. W. Huleihel and N. Merhav, ``Codewords with memory improve achievable rate regions of the Gaussian memoryless interference channel,'' unpublished 2015.
  11. N. Weinberger and N. Merhav, ``The DNA-storage channel: capacity and error probability bounds,'' submitted for publication, August 2021.