Back to main page

 Codes Defined on Graphs and Iterative Decoding Algorithms
 


The focus of this research work is on the tradeoff between performance & complexity via information-theoretic bounds and the analysis of practical modern error-correcting codes which closely approach these bounds with low complexity under iterative decoding, universal properties of capacity-approaching LDPC code ensembles, and rigorous bounds on the number of iterations.


Journal Papers
  1. M. Raginsky and I. Sason, "Concentration of measure inequalities in information theory, communications and coding," Foundations and Trends in Communications and Information Theory, vol. 10, no. 1-2, pp. 1-246, October 2013. See also arXiv.

  2. I. Sason and B. Shuval, " On universal LDPC codes over memoryless symmetric channels," IEEE Trans. on Information Theory, vol. 57, no. 8, pp. 5182 -- 5202, August 2011.

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

  4. I. Sason, "On universal properties of capacity-approaching LDPC code ensembles," IEEE Trans. on Information Theory, vol. 55, no. 7, pp. 2956 -- 2990, July 2009.

  5. I. Sason and G. Wiechman, "Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel," IEEE Trans. on Information Theory, vol. 55, no. 6, pp. 2602 -- 2617, June 2009.

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

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

  8. I. Sason and I. Goldenberg, "Coding for parallel channels: Gallager bounds for binary linear codes with applications to turbo-like codes," IEEE Trans. on Information Theory, vol. 53, no. 7, pp. 2394 -- 2428, July 2007.

  9. H. Pfister and I. Sason, "Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity," IEEE Trans. on Information Theory, vol. 53, no. 6, pp. 2088 -- 2115, June 2007.

  10. I. Sason and G. Wiechman, "On achievable rates and complexity of LDPC codes over parallel channels: bounds and applications," IEEE Trans. on Information Theory, vol. 53, no. 2, pp. 580 -- 598, February 2007.

  11. G. Wiechman and I. Sason, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels: New bounds and applications," IEEE Trans. on Information Theory, vol. 53, no. 2, pp. 550 -- 579, February 2007.

  12. H. Pfister, I. Sason and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans. on Information Theory, vol. 51, no. 7, pp. 2352 -- 2379, July 2005. slides.

  13. I. Sason and R. Urbanke, "Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the erasure channel," IEEE Trans. on Information Theory, vol. 50, no. 6, pp. 1247 -- 1256, June 2004.

  14. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels," IEEE Trans. on Information Theory, vol. 49, no. 7, pp. 1611 -- 1635, July 2003. poster.

  15. I. Sason and S. Shamai, "Improved upper bounds on the ensemble performance of ML decoded low-density parity-check codes," IEEE Communications Letters, vol. 4, no. 3, pp. 89 -- 91, March 2000.


Some Talks on this Research Work
  1. I. Sason and R. Eshel, ``On concentration of measures for LDPC code ensembles,'' Proceedings 2011 IEEE International Symposium on Information Theory (ISIT 2011), pp. 1273-1277, Saint Petersburg, Russia, August 2011. Slides.

  2. I. Sason, ``On universal properties of capacity-approaching LDPC code ensembles,'' seminar talk on Communications and Information Theory, Department of Electrical Engineering, Technion - Israel Institute of Technology, Haifa, Israel, November 2010.

  3. I. Sason and B. Shuval, ``On universal LDPC code ensembles,'' Proceedings 2010 IEEE International Symposium on Information Theory (ISIT 2010), pp. 689-693, Austin, Texas, USA, June 2010. Slides.

  4. 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, South Korea, July 2009. Slides.

  5. 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, South Korea, July 2009. Slides

  6. 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, South Korea, July 2009. Slides

  7. I. Sason, ``On universal properties of capacity-approaching LDPC code ensembles,'' presented at the 2009 Workshop on Information Theory and Applications, UCSD, La Jolla, California, USA, February 2009.

  8. I. Sason and G. Wiechman, ``Bounds on the convergence speed of iterative message-passing decoders over the binary erasure channel,'' Proceedings the Fifth International Symposium on Turbo Codes and Related Topics (Turbo Coding 2008), pp. 157-161, Lausanne, Switzerland, September 2008. Slides.

  9. I. Sason and G. Wiechman, ``Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel,'' Proceedings 2008 IEEE International Symposium on Information Theory (ISIT 2008), pp. 1898-1902, Toronto, Ontario, Canada, July 2008.

  10. G. Wiechman and I. Sason, ``An improved sphere-packing bound over memoryless symmetric channels,'' presented in part as an invited talk at the 2008 Information Theory and Applications (ITA) Workshop at UCSD, San Diego, California, January 2008. Slides.

  11. I. Sason, ``Information-theoretic bounds on the parity-check density of LDPC codes,'' presented in part as an invited talk at the 2007 Information Theory and Applications (ITA) Workshop at UCSD, San Diego, California, January 2007. Slides.

  12. I. Sason, ``Information-theoretic bounds on the parity-check density of LDPC codes: old and new results,'' extended seminar talk given at EPFL (Lausanne) and ETH (Zurich) in December 2006.

  13. I. Sason and H. Pfister, ``Recent results on capacity-achieving codes for the erasure channel with bounded complexity,'' (an invited talk), Proceedings of the 24th IEEE Convention of Electrical and Electronics Engineers in Israel, pp. 339 - 343, Eilat, Israel, November 2006. Slides.
  14. I. Sason and G. Wiechman, ``On achievable rates and complexity of LDPC codes for parallel channels: information-theoretic bounds and applications,'' Proceedings 2006 IEEE International Symposium on Information Theory (ISIT 2006), pp. 406-410, Seattle, Washington, USA, July 2006. Slides.

  15. I. Sason and G. Wiechman, ``Performance versus complexity per iteration for low-density parity-check codes: an information-theoretic approach,'' Proceedings of the Fourth International Symposium on Turbo Codes and Related Topics, Munich, Germany, April 2006. Slides.

  16. H. Pfister and I. Sason, ``Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity," Forty-Third Annual Allerton Conference on Communication, Control and Computing (invited paper), pp. 30-45, Urbana-Champaign, IL, USA, September 2005. Slides.

  17. G. Wiechman and I. Sason, ``On the Parity-Check Density and Achievable Rates of LDPC Codes for Memoryless Binary-Input Output-Symmetric Channels," Forty-Third Annual Allerton Conference on Communication, Control and Computing, pp. 1747-1758, Urbana-Champaign, IL, USA, September 2005. Slides.