Back to main page


Contributed Talks (I. Sason)

  1. 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 (MELECON '98), pp. 856 - 860, Tel-Aviv, Israel, May 1998.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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.

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

  8. I. Sason and S. Shamai (Shitz), ``Gallager bounding techniques and their variations, with application to performance bounds over Gaussian and fading channels,'' presented at the Summer Research Institute, EPFL, Lausanne, Switzerland, July 9, 2001.

  9. 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.

  10. 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.

  11. 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.

  12. 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.

  13. 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.

  14. 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.

  15. 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 & Electronics Engineers in Israel (IEEEI'04), pp. 110-113, Herzlia, Israel, September 2004.

  16. 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.

  17. I. Sason, ``Capacity-achieving codes for the binary erasure channel with bounded complexity,'' Summer Research Institute, EPFL, Lausanne, Switzerland, July 18, 2006.

  18. 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.

  19. I. Sason, ``Information-theoretic bounds on the parity-check density of LDPC codes: old and new results,'' presented at the 2nd Workshop on Information Theory & Applications (ITA 2007), UCSD, La Jolla, San-Diego, California, USA, February 2007.

  20. 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 & Applications (ITA 2008), pp. 362-367, UCSD, La Jolla, San-Diego, California, USA, February 2008.

  21. 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.

  22. 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.

  23. I. Sason, ``On universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles,'' presented at the 25th IEEE Convention of Electrical and Electronics Engineers in Israel, Eilat, Israel, December 2008.

  24. I. Sason, ``On universal properties of capacity-approaching LDPC code ensembles,'' presented at the 4th Workshop on Information Theory & Applications (ITA 2009), UCSD, La Jolla, San-Diego, California, USA, February 2009.

  25. 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.

  26. 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.

  27. 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.

  28. 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.

  29. 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.

  30. I. Sason, ``On the concentration of the crest factor for OFDM signals,'' Proceedings of the 8th International Symposium on Wireless Communication Systems (ISWCS '11), pp. 784--788, Aachen, Germany, November 2011.

  31. I. Sason, ``On concentration for martingales and applications in information theory and communications,'' presented at the 7th Workshop on Information Theory & Applications (ITA 2012), La Jolla, San-Diego, California, USA, February 2012.

  32. I. Sason, ``Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded increments,'' Proceedings of the 2012 International Workshop on Applied Probability (IWAP 2012), p. 59, Jerusalem, Israel, June 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. 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.

  35. I. Sason, ``On the entropy of sums of Bernoulli random variables via the Chen-Stein method,'' Proceedings of the 2012 IEEE International Workshop on Information Theory (ITW 2012), pp. 542-546, Lausanne, Switzerland, September 2012.

  36. I. Sason, ``On the entropy of sums of Bernoulli random variables via the Chen-Stein method,'' presented as an invited talk at the 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, Eilat, Israel, November 14-17, 2012.

  37. I. Sason, ``Improved lower bounds on the total variation distance and relative entropy for the Poisson approximation,'' Proceedings of the 8th Workshop on Information Theory & Applications (ITA 2013), pp. 360-363, La Jolla, San-Diego, California, USA, February 10-15, 2013.

  38. I. Sason, ``Entropy bounds for discrete random variables via coupling,'' Proceedings of the 2013 IEEE International Symposium on Information Theory (ISIT 2013), pp. 414-418, Istanbul, Turkey, July 2013.

  39. I. Sason, ``On the corner points of the capacity region of a Gaussian interference channel,'' Proceedings of the 51st Annual Allerton Conference on Communication, Control and Computing, pp. 594--598, Urbana-Champaign, Illinois, USA, October 2-4, 2013. Also presented at the 9th Workshop on Information Theory & Applications (ITA 2014), La Jolla, San-Diego, California, USA, February 9--14, 2014.

  40. 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.