My Homepage Back to main page


Journal Papers (I. Sason)

  1. I. Sason, "Observations on graph invariants with the Lovasz theta-function,'' AIMS Mathematics, vol. 9, no. 6, pp. 15385-15468 (84 pages), April 2024.

  2. I. Sason, "Observations on the Lovasz theta-function, graph capacity, eigenvalues, and strong products,'' Entropy, vol. 25, no. 1, paper 104, pages 1-40, January 2023.

  3. I. Sason, "Divergence measures: mathematical foundations and applications in information-theoretic and statistical problems,'' Entropy, vol. 24, no. 5, paper 712 (editorial), pages 1-5, May 2022.

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

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

  6. I. Sason, "A generalized information-theoretic approach for bounding the number of independent sets in bipartite graphs,'' Entropy, vol. 23, no. 3, paper 270, pages 1-14, March 2021.

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

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

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

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

  11. 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). Available also in the IEEE Explore and online here.
     See also the presentation of the following 3-hour tutorial talk at ISIT 2015: 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.
  12. 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.

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

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

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

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

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

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

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

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

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

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

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

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

  25. I. Sason, "Improved lower bounds on the total variation distance for the Poisson approximation," Statistics and Probability Letters, vol. 83, no. 10, pp. 2422-2431, October 2013.

  26. I. Sason, "Tightened exponential bounds for discrete time, conditionally symmetric martingales with bounded jumps," Statistics and Probability Letters, vol. 83, no. 8, pp. 1928-1936, August 2013.

  27. E. Hof, I. Sason, S. Shamai and C. Tian, "Capacity-achieving polar codes for arbitrarily-permuted parallel channels,'' IEEE Transactions on Information Theory, vol. 59, no. 3, 1505-1516, March 2013.

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

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

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

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

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

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

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

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

  36. M. Twitto, I. Sason and S. Shamai, "Tightened upper bounds on the ML decoding error probability of binary linear block codes," IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1495-1510, April 2007.

  37. M. Twitto and I. Sason, "On the error exponents of some improved tangential-sphere bounds," IEEE Transactions on Information Theory, vol. 53, no. 3, pp. 1196-1210, March 2007.

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

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

  40. I. Sason and S. Shamai, Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial, Foundations and Trends in Communications and Information Theory, vol. 3, no. 1-2, pp. 1-222, NOW Publishers, Delft, the Netherlands, July 2006.

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

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

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

  44. I. Sason, S. Shamai and D. Divsalar, "Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels," IEEE Transactions on Communications, vol. 51, no. 8, pp. 1296-1305, August 2003.

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

  46. I. Sason, E. Telatar and R. Urbanke, "Asymptotic input-output weight distributions and thresholds of convolutional and turbo-like codes," IEEE Transactions on Information Theory, vol. 48, no. 12, pp. 3052-3061, December 2002.

  47. S. Shamai and I. Sason, "Variations on the Gallager bounds, connections and applications," IEEE Transactions on Information Theory, vol. 48, no. 12, pp. 3029-3051, December 2002.

  48. S. Shamai and I. Sason, "Variations on Gallager bounds with some applications,'' Physica A: Statistical Mechanics and Its Applications, Elsevier Science, vol. 302, no. 1-4, pp. 22-34, December 2001.

  49. I. Sason and S. Shamai,  "On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes," IEEE Transactions on Information Theory, vol. 47, no. 6, pp. 2275-2299, September 2001.

  50. I. Sason and S. Shamai, "On union bounds for random serially concatenated turbo codes with maximum likelihood decoding," European Transactions on Telecommunications, vol. 11, no. 3, pp. 271-282, May/ June 2000.

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

  52. I. Sason and S. Shamai, "Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum," IEEE Transactions on Information Theory, vol. 46, no. 1, pp. 24-47, January 2000.

  53. M. Peleg, I. Sason, S. Shamai and A. Elia, "On interleaved, differentially encoded convolutional codes," IEEE Transactions on Information Theory, vol. 45, no. 7, pp. 2572-2582, November 1999.

  54. I. Sason and S. Shamai, "Bounds on the error probability for block and turbo-block codes," Annals of Telecommunications, vol. 54, no. 3 - 4, pp. 183-200, March - April 1999.