Back to main page


Conference talks (and some recent seminar talks)

1. I. Sason, ``On strongly regular graphs, friendship, and the Shannon capacity,'' 2025 Information Theory and Applications Workshop, San-Diego, California, USA, February 9-14, 2025. See the slides of the presentation, and their extended version.
   
   
2. I. Sason, "Entropy, counting, and Shearer's inequalities," the Einstein Institute of Mathematics, Hebrew University of Jerusalem, Israel, December 16, 2024. See the abstract and slides.
   
   
3. I. Sason, "Combinatorial applications of the Shearer and Han inequalities in graph theory and Boolean functions,'' Workshop on Information Theory, Boolean Functions, and Lattice Problems, Hausdorff Research Institute for Mathematics (HIM), Bonn, Germany, November 18-22, 2024. See the slides and recorded talk.
   
   
4. I. Sason, "Combinatorial applications of the Shearer's lemma and generalizations," seminar talk at ETH - Swiss Federal Institute of Technology, Zurich, Switzerland, November 1, 2024. See the slides.
   
   
5. I. Sason, ``Observations on the Lovasz theta-function, Shannon capacity of graphs, eigenvalues, and strong products,'' Proceedings of the 10th Slovenian Conference on Graph Theory (SiCGT23), Kranjska Gora, Slovenia, June 18-24, 2023. See the slides.
   
   
6. I. Sason, "Shannon entropy and bipartite graphs,'' Mini-Workshop on New Mathematical Techniques in Information Theory, the Mathematical Research Institute of Oberwolfach (MFO), Germany, March 13-19, 2022. See the slides and the recorded talk.
   
   
7. I. Sason, ``Entropy-based proofs of combinatorial results on bipartite graphs," Proceedings of the 2021 IEEE International Symposium on Information Theory, pp. 3225-3230, July 12-20, 2021 (an online virtual conference). See the paper, slides, recorded short and full presentations.
   
   
8. 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.
   
   
9. 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.
   
   
10. I. Sason, ``Tight bounds on the Renyi entropy via majorization with applications to guessing and compression,'' Information Theory and Applications Workshop (ITA 2020), San-Diego, California, USA, February 2-7, 2020. See the slides.
    
    
11. I. Sason, ``Entropy and guessing: old and new results,'' 2019 Workshop on Mathematical Data Science, Durnstein, Austria, October 13-15, 2019. See the slides.
    
    
12. I. Sason, ``Tight bounds on the Renyi entropy via majorization with applications to guessing and lossless compression,'' 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.
    
    
13. 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.
    
    
14. 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.
    
    
15. 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.
    
    
16. 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.
    
    
17. 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.
    
    
18. 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.
    
    
19. 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.
    
    
20. 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.
    
    
21. 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.
    
    
22. 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.
    
    
23. 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. See also our monograph (or in the IEEE Explore), which has been published in the Foundations and Trends in Communications and Information Theory, as a third edition, in March 2019.
    
    
24. 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.
    
    
25. 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.
    
    
26. 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.
    
    
27. 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.
    
    
28. 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.
    
    
29. 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.
    
    
30. 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.
    
    
31. I. Sason, a series of three talks related to some information-theoretic aspects that are linked to concentration and the Chen-Stein method, ETH - Swiss Federal Institute of Technology, Zurich, August 20-23, 2012. See: Talk 1, and Talks 2-3.
    
    
32. K. Xenoulis, N. Kalouptsidis and I. Sason, ``New achievable rates for nonlinear Volterra channels via martingale inequalities,'' Proceedings of the 2012 IEEE International Symposium on Information Theory (ISIT 2012), pp. 1430-1434, MIT, Boston, MA, USA, July 2012.
    
    
33. I. Sason, ``Moderate deviations analysis of binary hypothesis testing,'' Proceedings of the 2012 IEEE International Symposium on Information Theory (ISIT 2012), pp. 826-830, MIT, Boston, MA, USA, July 2012.
    
    
34. I. Sason, ``Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded increments,'' Proceedings of the 2012 International Workshop on Applied Probability, p. 59, Jerusalem, Israel, June 2012.
    
    
35. I. Sason, ``On concentration for martingales and applications in information theory and communications,'' Workshop on Information Theory and Applications, San-Diego, California, USA, February 2012.
    
    
36. I. Sason, ``On the concentration of the crest factor for OFDM signals,'' Proceedings of the 8th International Symposium on Wireless Communication Systems, pp. 784--788, Aachen, Germany, November 2011.
    
    
37. I. Sason and R. Eshel, ``On concentration of measures for LDPC code ensembles,'' Proceedings of the 2011 IEEE International Symposium on Information Theory (ISIT 2011), pp. 1273-1277, Saint Petersburg, Russia, August 2011.
    
    
38. I. Sason and B. Shuval, ``On universal LDPC code ensembles for memoryless symmetric channels,'' Workshop on Information Theory and Applications, San-Diego, California, USA, February 2011.
    
    
39. I. Sason, ``Linear programming bounds on the degree distributions of LDPC code ensembles,'' Proceedings of the 2009 IEEE International Symposium on Information Theory (ISIT 2009), pp. 224-228, Seoul, Korea, July 2009.
    
    
40. I. Sason, ``Lower bounds on the graphical complexity of finite-length LDPC codes,'' Proceedings of the 2009 IEEE International Symposium on Information Theory (ISIT 2009), pp. 219--223, Seoul, Korea, July 2009.
    
    
41. I. Sason, ``On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles,'' Proceedings of the 2009 IEEE International Symposium on Information Theory (ISIT 2009), pp. 75-79, Seoul, Korea, July 2009.
    
    
42. I. Sason, ``On universal properties of capacity-approaching LDPC code ensembles,'' Workshop on Information Theory and Applications, San-Diego, California, USA, February 2009.
    
    
43. I. Sason, ``On universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles,'' 25th IEEE Convention of Electrical and Electronics Engineers in Israel, Eilat, Israel, December 2008.
    
    
44. I. Sason and G. Wiechman, ``Bounds on the convergence speed of iterative message-passing decoders over the binary erasure channel,'' Proceedings of the Fifth International Symposium on Turbo Codes and Related Topics (Turbo Coding 2008), pp. 157-161, Lausanne, Switzerland, September 2008.
    
    
45. I. Sason and G. Wiechman, ``Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel,'' Proceedings of the 2008 IEEE International Symposium on Information Theory (ISIT 2008), pp. 1898-1902, Toronto, Ontario, Canada, July 2008.
    
    
46. 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.
    
    
47. I. Sason, ``Information-theoretic bounds on the parity-check density of LDPC codes: old and new results,'' Workshop on Information Theory and Applications, UCSD, San-Diego, California, USA, February 2007.
    
    
48. I. Sason and H. Pfister, ``Recent results on capacity-achieving codes for the erasure channel with bounded complexity,'' Proceedings of the 24th IEEE Convention of Electrical and Electronics Engineers in Israel, pp. 339-343, Eilat, Israel, November 2006.
    
    
49. I. Sason, ``Capacity-achieving codes for the binary erasure channel with bounded complexity,'' Summer Research Institute, EPFL, Lausanne, Switzerland, July 18, 2006.
    
    
50. H. Pfister, I. Sason and R. Urbanke, ``Bounds on the decoding complexity of punctured codes on graphs,'' Proceedings of the Forty-Second Annual Allerton Conference on Communication, Control and Computing , pp. 481-491, University of Illinois, Urbana-Champaign, Illinois, USA, September 2004.
    
    
51. H. Pfister, I. Sason and R. Urbanke, ``Capacity-achieving ensembles for the binary erasure channel with bounded complexity,'' Proceedings of the 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, pp. 110-113, Herzlia, Israel, September 2004.
    
    
52. I. Sason, ``On achievable rate regions for the Gaussian interference channel,'' Proceedings of the 2004 IEEE International Symposium on Information Theory, p. 1, Chicago, Illinois, USA, June 2004.
    
    
53. I. Sason and R. Urbanke, ``On the complexity of irregular repeat-accumulate codes on the erasure channel,'' Proceedings of the Third International Symposium on Turbo Codes and Related Topics, pp. 133-136, Brest, France, September 2003.
    
    
54. I. Sason and R. Urbanke, ``Information-theoretic lower bounds on the bit error probability of codes on graphs,'' Proceedings of the 2003 IEEE International Symposium on Information Theory, p. 268, Yokohama, Japan, July 2003.
    
    
55. I. Sason and R. Urbanke, ``How sparse can parity-check matrices of binary linear codes be, as a function of their gap to capacity ?,'' Proceedings of the Fortieth Annual Allerton Conference on Communication, Control and Computing, pp. 1139-1148, Urbana-Champaign, Illinois, USA, October 2002.
    
    
56. I. Sason, ``Identification of new classes of non-Shannon type information inequalities and their relations to finite groups,'' Proceedings of the IEEE 2002 International Symposium on Information Theory (ISIT 2002), p. 236, Lausanne, Switzerland, June 30-July 5, 2002.
    
    
57. I. Sason, S. Shamai (Shitz) and D. Divsalar, ``On simple and tight upper bounds on the ML decoding error probability for block codes over interleaved fading channels,'' Proceedings of the Sixth International Symposium on Communication Theory and Applications (ISCTA 06), pp. 236-241, Ambleside, UK, July 2001.
    
    
58. I. Sason and S. Shamai (Shitz), ``Gallager bounding techniques and their variations, with application to performance bounds over Gaussian and fading channels,'' Summer Research Institute, EPFL, Lausanne, Switzerland, July 9, 2001.
    
    
59. I. Sason and S. Shamai (Shitz), ``On Gallager-type bounds for the mismatched decoding regime with applications to turbo codes,'' Proceedings of the 2001 IEEE International Symposium on Information Theory (ISIT 2001), p. 134, Washington, D.C., USA, June 2001.
    
    
60. I. Sason and S. Shamai (Shitz), ``On improved bounds on coded communications over interleaved fading channels, with applications to turbo codes,'' Proceedings of the Second International Symposium on Turbo Codes and Related Topics, pp. 239-242, Brest, France, September 2000.
    
    
61. I. Sason and S. Shamai (Shitz), ``Improved upper bounds on the ML performance of turbo codes for interleaved Rician fading channels, with comparison to iterative decoding,'' Proceedings of the 2000 IEEE International Conference on Communications (ICC 2000), pp. 591-596, New Orleans, LA, USA, June 2000.
    
    
62. I. Sason and S. Shamai (Shitz), ``On Gallager bounding technique with applications to turbo-like codes over fading channels,'' Proceedings of the IEEE 21st Convention of the Electrical and Electronic Engineers in Israel, pp. 431-434, Tel-Aviv, Israel, April 2000.
    
    
63. I. Sason and S. Shamai (Shitz), ``Tangential sphere bounds on the ensemble performance of ML decoded low-density parity-check codes,'' Proceedings of the Third ITG Conference on Source and Channel Coding, pp. 161-166, Munich, Germany, January 17--19, 2000.
    
    
64. I. Sason and S. Shamai (Shitz), ``Improved upper bounds on the performance of parallel and serial concatenated codes via their ensemble distance spectrum,'' Proceedings of the 1998 IEEE International Symposium on Information Theory (ISIT 1998), p. 30, Cambridge, MA, USA, August 1998.
    
    
65. I. Sason and S. Shamai (Shitz), ``Distance spectrum improved upper bounds for parallel and concatenated turbo codes,'' Proceedings of the IEEE 9th International Electrotechnical Conference, pp. 856 - 860, Tel-Aviv, Israel, May 1998.