Back to the main page on my research interests

 Shannon theory and information measures
 


Journal Papers
  1. I. Sason, "Counting graph homomorphisms in bipartite settings," submitted, September 2025; revised, July 2026.

  2. I. Sason, "Mathematical foundations of information theory (editorial paper)," AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 11, no. 2, paper 132, pp. 3269-3274, February 2026.

  3. N. Lavi and I. Sason, "Advances in the Shannon capacity of graphs," AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 11, no. 1, paper 111, pp. 2747-2796, January 2026.

  4. I. Sason, "An example showing that Schrijver's theta-function need not upper bound the Shannon capacity of a graph,'' AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 10, no. 7, paper 695, pp. 15294-15301, July 2025.

  5. I. Sason, "Observations on graph invariants with the Lovasz theta-function,'' AIMS Mathematics, special issue: Mathematical Foundations of Information Theory, vol. 9, no. 6, paper 747, pp. 15385-15468, April 2024.

  6. I. Sason, "Information inequalities via submodularity, and a problem in extremal graph theory,'' Entropy, vol. 24, no. 5, paper 597, pages 1-31, April 2022.

  7. R. Graczyk and I. Sason, "On two-stage guessing," Information, vol. 12, no. 4, paper 159, pages 1-20, April 2021.

  8. N. Merhav and I. Sason, "Some useful integral representations for information-theoretic analyses,'' Entropy, vol. 22, no. 6, paper 707, pages 1-29, June 2020.

  9. T. Nishiyama and I. Sason, "On relations between the relative entropy and chi-squared divergence, generalizations and applications,'' Entropy, vol. 22, no. 5, paper 563, pages 1-36, May 2020.

  10. N. Merhav and I. Sason, "An integral representation of the logarithmic function with applications in information theory,'' Entropy, vol. 22, no. 1, paper 51, pages 1-22, January 2020.

  11. I. Sason, "On data-processing and majorization inequalities for f-divergences with applications,'' Entropy, vol. 21, no. 10, paper 1022, pp. 1-80, October 2019.

  12. M. Raginsky and I. Sason, Concentration of Measure Inequalities in Information Theory, Communications, and Coding: Third Edition, Foundations and Trends in Communications and Information Theory, pp. 1-250, NOW Publishers, Delft, the Netherlands, December 2018 (first edition in October 2013).

  13. I. Sason, "Tight bounds on the Renyi entropy via majorization with applications to guessing and compression,'' Entropy, vol. 20, no. 12, paper 896, pp. 1-25, November 2018.

  14. I. Sason and S. Verdu, "Improved bounds on lossless source coding and guessing moments via Renyi measures,'' IEEE Transactions on Information Theory, vol. 64, no. 6, pp. 4323-4346, June 2018.

  15. I. Sason, "On f-divergences: integral representations, local behavior, and inequalities,'' Entropy, vol. 20, no. 5, paper 383, pp. 1-32, May 2018.

  16. I. Sason and S. Verdu, "Arimoto-Renyi conditional entropy and Bayesian M-ary hypothesis testing,'' IEEE Transactions on Information Theory, vol. 64, no. 1, pp. 4-25, January 2018.

  17. E. Ram and I. Sason, "On Renyi entropy power inequalities,'' IEEE Transactions on Information Theory, vol. 62, no. 12, pp. 6800-6815, December 2016.

  18. I. Sason and S. Verdu, "f-divergence inequalities," IEEE Transactions on Information Theory, vol. 62, no. 11, pp. 5973-6006, November 2016.
    This version is identical to the journal paper, with the following additions: Sections III-C and IV-F, and 3 technical proofs.

  19. M. A. Kumar and I. Sason, "Projection theorems for the Renyi divergence on alpha-convex sets,'' IEEE Transactions on Information Theory, vol. 62, no. 9, pp. 4924-4935, September 2016.

  20. I. Sason, "On the Renyi divergence, joint range of relative entropies, and a channel coding theorem," IEEE Transactions on Information Theory, vol. 62, no. 1, pp. 23-34, January 2016.

  21. M. Raginsky and I. Sason, "Concentration of measure inequalities and their communication and information-theoretic applications'' (invited paper), IEEE Information Theory Society Newsletter, vol. 65, no. 4, pp. 24-34, December 2015.

  22. I. Sason, "On the corner points of the capacity region of a two-user Gaussian interference channel,'' IEEE Transactions on Information Theory, vol. 61, no. 7, pp. 3682-3697, July 2015.

  23. M. Mondelli, S. H. Hassani, I. Sason, and R. Urbanke, "Achieving Marton's region for broadcast channels using polar codes," IEEE Transactions on Information Theory, vol. 61, no. 2, pp. 783-800, February 2015.

  24. I. Sason, "Tight bounds for symmetric divergence measures and a refined bound for lossless source coding,'' IEEE Transactions on Information Theory, vol. 61, no. 2, pp. 701-707, February 2015.

  25. I. Sason, "Entropy bounds for discrete random variables via maximal coupling," IEEE Transactions on Information Theory, vol. 59, no. 11, pp. 7118-7131, November 2013.

  26. E. Hof, I. Sason, and S. Shamai, "Performance bounds for erasure, list and feedback schemes with linear block codes," IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3754-3778, August 2010.

  27. E. Hof, I. Sason, and S. Shamai, "Performance bounds for non-binary linear block codes over memoryless symmetric channels,'' IEEE Transactions on Information Theory, vol. 55, no. 3, pp. 977-996, March 2009.

  28. G. Wiechman and I. Sason, "An improved sphere-packing bound for finite-length codes on symmetric memoryless channels," IEEE Transactions on Information Theory, vol. 54, no. 5, pp. 1962-1990, May 2008.

  29. I. Sason, "On achievable rate regions for the Gaussian interference channel," IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 1345-1356, June 2004.

Some Talks on this Research Work
  1. N. Merhav and I. Sason, ``Exact expressions in source and channel coding problems using integral representations,'' Proceedings of the 2020 IEEE International Symposium on Information Theory, pp. 2361-2366, June 21-26, 2020 (an online virtual conference). See the paper, slides and recorded talk.

  2. I. Sason, ``On data-processing and majorization inequalities for f-divergences,'' Proceedings of the 2020 International Zurich Seminar on Information and Communication, pp. 101-105, Zurich, Switzerland, February 26-28, 2020. See the paper and slides.

  3. I. Sason, ``Tight bounds on the Renyi entropy via majorization with applications to guessing and compression,'' seminar at ETH, October 2019. See the slides.
    A shortened version was presented at the Information Theory and Applications Workshop (ITA 2020), San-Diego, California, USA, February 2-7, 2020. See the slides.

  4. I. Sason, ``Entropy and guessing: old and new results,'' 2019 Workshop on Mathematical Data Science, Durnstein, Austria, October 13-15, 2019. See the slides and an extended version.

  5. I. Sason, ``Probabilities, Renyi entropy, and guessing,'' Proceedings of the Prague Stochastics 2019, p. 13, Institute of Information Theory and Automation, Czech Academy of Science, Prague, Czech Republic, August 19-23, 2019. See the slides.

  6. I. Sason and S. Verdu, ``Improved bounds on guessing moments via Renyi measures,'' Proceedings of the 2018 IEEE International Symposium on Information Theory, pp. 566-570, Vail, Colorado, USA, June 17-22, 2018. See the conference paper and slides.

  7. I. Sason and S. Verdu, ``Non-asymptotic bounds for optimal fixed-to-variable lossless compression without prefix constraints,'' Proceedings of the 2018 IEEE International Symposium on Information Theory, pp. 2211-2215, Vail, Colorado, USA, June 17-22, 2018. See the conference paper and slides.

  8. I. Sason, ``On Csiszar's f-divergences and informativities with applications,'' Conference on Channels, Statistics, Information, Secrecy and Randomness for celebrating the 80th birthday of Imre Csiszar, the Alfred Renyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary, June 4-5, 2018. See the abstract and the slides.

  9. I. Sason and S. Verdu, ``Arimoto-Renyi conditional entropy and Bayesian M-ary hypothesis testing,'' seminar talk, Nov. 2017, Department of Electrical Engineering, Technion - Israel Institute of Technology, Haifa, Israel.

  10. I. Sason and S. Verdu, ``Arimoto-Renyi conditional entropy and Bayesian M-ary hypothesis testing,'' Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT 2017), pp. 2975-2979, Aachen, Germany, June 25-30, 2017. See the conference paper and slides.

  11. I. Sason, ``On f- and Renyi divergences,'' seminar talk (part of this talk relies on a joint work with S. Verdu), Dec. 2016, Department of Electrical Engineering, Technion - Israel Institute of Technology, Haifa, Israel.

  12. I. Sason and S. Verdu, ``f-divergence inequalities via functional domination,'' Proceedings of the 2016 IEEE International Conference on the Science of Electrical Engineering, Eilat, Israel, November 16-18, 2016. See the conference paper and slides.

  13. E. Ram and I. Sason, ``On Renyi entropy power inequalities,'' Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT 2016), pp. 2289-2293, Barcelona, Spain, July 10-15, 2016. See the conference paper and slides.

  14. M. A. Kumar and I. Sason, ``On projections of the Renyi divergence on generalized convex sets,'' Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT 2016), pp. 1123-1127, Barcelona, Spain, July 10-15, 2016. See the conference paper and slides.

  15. I. Sason and S. Verdu, "Upper bounds on the relative entropy and Renyi divergence as a function of total variation distance for finite alphabets,'' Proceedings of the 2015 IEEE Information Theory Workshop (ITW 2015), pp. 214-218, Jeju Island, Korea, October 11-15, 2015. See the conference paper and slides.

  16. M. Raginsky and I. Sason, Concentration of Measure and Its Applications in Information Theory, Communications and Coding, 2015 IEEE International Symposium on Information Theory (ISIT 2015), Hong Kong, invited tutorial of 3 hours, June 2015. Slides: Part 1 and Part 2.
  17. I. Sason, "On the Renyi divergence, the joint range of relative entropies and a channel coding theorem,'' Proceedings of the 2015 IEEE International Symposium on Information Theory (ISIT 2015), pp. 1610-1614, Hong Kong, June 14-19, 2015. See the conference paper and slides. See also extended version of this talk.

  18. I. Sason, "Tight bounds on symmetric divergence measures and a new inequality relating f-divergences,'' Proceedings of the IEEE 2015 Information Theory Workshop (ITW 2015), Jerusalem, Israel, April 26-May 1, 2015. See the conference paper and slides.

  19. I. Sason, ``On the corner points of the capacity region of a Gaussian interference channel,'' Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 2739-2743, Honolulu, Hawaii, USA, July 2014. See the conference paper and slides.
  20. M. Mondelli, S. H. Hassani, I. Sason and R. Urbanke, ``Achieving Marton's region for broadcast channels using polar codes,'' Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 306-310, Honolulu, Hawaii, USA, July 2014. See the conference paper and slides.
  21. M. Raginsky and I. Sason, ``Refined bounds on the empirical distribution of good channel codes via concentration inequalities,'' Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 221-225, Istanbul, Turkey, July 2013. See the conference paper and presentation.

  22. I. Sason, ``Entropy bounds for discrete random variables via coupling,'' Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 414-418, Istanbul, Turkey, July 2013. See the conference paper and presentation.

  23. I. Sason, "New lower bounds on the total variation distance and relative entropy for the Poisson approximation,'' Proceedings of the 2013 Information Theory and Applications Workshop (ITA 2013), pp. 1-4, San-Diego, California, USA, February 2013. See the conference paper and presentation.

  24. G. Wiechman and I. Sason, ``An improved sphere-packing bound for finite-length codes over symmetric memoryless channels,'' Proceedings of the 3rd Workshop on Information Theory and Applications, pp. 362-367, San-Diego, California, USA, February 2008. Presentation and extended presentation.