Igal Sason

View Scopus Profile

Igal Sason

Prof.

 https://orcid.org/0000-0001-5681-1273

Accepting PhD Students

Calculated based on number of publications stored in Pure and citations from Scopus
1998 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2021

    Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs

    Sason, I., 12 Jul 2021, 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. p. 3225-3230 6 p. (IEEE International Symposium on Information Theory - Proceedings; vol. 2021-July).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations
  • 2020

    Exact Expressions in Source and Channel Coding Problems Using Integral Representations

    Merhav, N. & Sason, I., Jun 2020, 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. p. 2343-2348 6 p. 9174294. (IEEE International Symposium on Information Theory - Proceedings; vol. 2020-June).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • On Data-Processing and Majorization Inequalities for f-Divergences

    Sason, I., 2020, International Zurich Seminar on Information and Communication. p. 101-105

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2018

    Improved Bounds on Guessing Moments via Rényi Measures

    Sason, I. & Verdu, S., 15 Aug 2018, 2018 IEEE International Symposium on Information Theory, ISIT 2018. p. 566-570 5 p. 8437504. (IEEE International Symposium on Information Theory - Proceedings; vol. 2018-June).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints

    Sason, I. & Verdu, S., 15 Aug 2018, 2018 IEEE International Symposium on Information Theory, ISIT 2018. p. 2211-2215 5 p. 8437771. (IEEE International Symposium on Information Theory - Proceedings; vol. 2018-June).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Relations among the Minimum Error Probability, Guessing Moments, and Arimoto-Rényi Conditional Entropy

    Sason, I. & Verdú, S., 2018, International Zurich Seminar on Information and Communication : IZS 2018 .

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2017

    Arimoto-Rényi conditional entropy and Bayesian hypothesis testing

    Sason, I. & Verdú, S., 9 Aug 2017, 2017 IEEE International Symposium on Information Theory, ISIT 2017. p. 2965-2969 5 p. 8007073. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • F-Divergence inequalities via functional domination

    Sason, I. & Verdú, S., 4 Jan 2017, 2016 IEEE International Conference on the Science of Electrical Engineering, ICSEE 2016. 7806028. (2016 IEEE International Conference on the Science of Electrical Engineering, ICSEE 2016).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations

  • Random-coding error exponent of variable-length codes with a single-bit noiseless feedback

    Ginzach, S., Merhav, N. & Sason, I., 2017, 2017 IEEE Information Theory Workshop, ITW 2017. p. 584-588 5 p. (IEEE International Symposium on Information Theory - Proceedings; vol. 2018-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2016

    On projections of the Rényi divergence on generalized convex sets

    Kumar, M. A. & Sason, I., 10 Aug 2016, Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. p. 1123-1127 5 p. 7541474. (IEEE International Symposium on Information Theory - Proceedings; vol. 2016-August).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • On Rényi entropy power inequalities

    Ram, E. & Sason, I., 10 Aug 2016, Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. p. 2289-2293 5 p. 7541707. (IEEE International Symposium on Information Theory - Proceedings; vol. 2016-August).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations
  • 2015

    On the Rényi divergence and the joint range of relative entropies

    Sason, I., 28 Sep 2015, Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. p. 1610-1614 5 p. 7282728. (IEEE International Symposium on Information Theory - Proceedings; vol. 2015-June).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Tight bounds for symmetric divergence measures and a new inequality relating f-divergences

    Sason, I., 24 Jun 2015, 2015 IEEE Information Theory Workshop, ITW 2015. 7133079. (2015 IEEE Information Theory Workshop, ITW 2015).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    10 Scopus citations

  • Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabets

    Sason, I. & Verdu, S., 17 Dec 2015, ITW 2015 - 2015 IEEE Information Theory Workshop. p. 214-218 5 p. 7360766. (ITW 2015 - 2015 IEEE Information Theory Workshop).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    21 Scopus citations
  • 2014

    Achieving Marton's region for broadcast channels using polar codes

    Mondelli, M., Hassani, S. H., Urbanke, R. & Sason, I., 2014, 2014 IEEE International Symposium on Information Theory, ISIT 2014. p. 306-310 5 p. 6874844. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    3 Scopus citations

  • On the corner points of the capacity region of a two-user Gaussian interference channel

    Sason, I., 2014, 2014 IEEE International Symposium on Information Theory, ISIT 2014. p. 2744-2748 5 p. 6875333. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations
  • 2013

    Entropy bounds for discrete random variables via coupling

    Sason, I., 2013, 2013 IEEE International Symposium on Information Theory, ISIT 2013. p. 414-418 5 p. 6620259. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations

  • On the corner points of the capacity region of a two-user Gaussian interference channel

    Sason, I., 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. p. 594-598 5 p. 6736579. (2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Refined bounds on the empirical distribution of good channel codes via concentration inequalities

    Raginsky, M. & Sason, I., 2013, 2013 IEEE International Symposium on Information Theory, ISIT 2013. p. 221-225 5 p. 6620220. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2012

    Moderate deviations analysis of binary hypothesis testing

    Sason, I., 2012, 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. p. 821-825 5 p. 6284675. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    17 Scopus citations

  • New achievable rates for nonlinear Volterra channels via martingale inequalities

    Xenoulis, K., Kalouptsidis, N. & Sason, I., 2012, 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. p. 1425-1429 5 p. 6283497. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • On the entropy of sums of Bernoulli random variables via the Chen-Stein method

    Sason, I., 2012, 2012 IEEE Information Theory Workshop, ITW 2012. p. 542-546 5 p. 6404733. (2012 IEEE Information Theory Workshop, ITW 2012).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    5 Scopus citations
  • 2011

    On concentration of measures for LDPC code ensembles

    Sason, I. & Eshel, R., 2011, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. p. 1268-1272 5 p. 6033740. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • On the concentration of the crest factor for OFDM signals

    Sason, I., 2011, ISWCS'11 - 2011 8th International Symposium on Wireless Communication Systems, Proceedings. p. 784-788 5 p. 6125269. (Proceedings of the International Symposium on Wireless Communication Systems).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    4 Scopus citations
  • 2010

    On the universality of LDPC code ensembles under belief propagation and ML decoding

    Shuval, B. & Sason, I., 2010, 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010. p. 355-359 5 p. 5662204. (2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    6 Scopus citations

  • On universal ldpc code ensembles

    Sason, I. & Shuval, B., 2010, 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. p. 689-693 5 p. 5513584. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • Polar coding for degraded and non-degraded parallel channels

    Hof, E., Sason, I. & Shamai, S., 2010, 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010. p. 550-554 5 p. 5662158. (2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Polar coding for reliable communications over parallel channels

    Hof, E., Sason, I. & Shamai, S., 2010, 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings. 5592728. (2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    16 Scopus citations
  • 2009

    Linear programming bounds on the degree distributions of LDPC code ensembles

    Sason, I., 2009, 2009 IEEE International Symposium on Information Theory, ISIT 2009. p. 224-228 5 p. 5205866. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations

  • Lower bounds on the graphical complexity of finite-length LDPC codes

    Sason, I., 2009, 2009 IEEE International Symposium on Information Theory, ISIT 2009. p. 219-223 5 p. 5205822. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles

    Sason, I., 2009, 2009 IEEE International Symposium on Information Theory, ISIT 2009. p. 75-79 5 p. 5205638. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Performance bounds for erasure, list and feedback schemes with linear block codes

    Hof, E., Sason, I. & Shamai, S., 7 Dec 2009, 2009 IEEE Information Theory Workshop, ITW 2009. p. 303-307 5 p. 5351236. (2009 IEEE Information Theory Workshop, ITW 2009).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2008

    An improved sphere-packing bound for finite-length codes over symmetric memoryless channels

    Wiechman, G. & Sason, I., 2008, 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA. p. 320-325 6 p. 4601067. (2008 Information Theory and Applications Workshop - Conference Proceedings, ITA).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Bounds on the convergence speed of iterative message-passing decoders over the binary erasure channel

    Sason, I. & Wiechman, G., 2008, 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING. p. 157-161 5 p. 4658690. (2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel

    Sason, I. & Wiechman, G., 2008, Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. p. 1898-1902 5 p. 4595318. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • Gallager-type bounds for non-binary linear block codes over memoryless symmetric channels

    Hof, E., Sason, I. & Shamai, S., 2008, 2008 IEEE Information Theory Workshop, ITW. p. 26-30 5 p. 4578615. (2008 IEEE Information Theory Workshop, ITW).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2006

    Analytical bounds on maximum-likelihood decoded linear codes with applications to turbo-like codes: An overview

    Sason, I. & Shamai, S., 2006, TURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding. (TURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Analytical bounds on maximum-likelihood decoded linear codes with applications to turbo-like codes: An overview

    Sason, I. & Shamai, S., 2006, Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on. 5755824. (Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Coding for parallel channels: gallager bounds and applications to repeat-accumulate codes

    Sason, I. & Goldenberg, I., 2006, 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI. p. 334-338 5 p. 4115306. (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    2 Scopus citations

  • Log-domain calculation of the 1959 sphere-packing bound with application to M-ary PSK block coded modulation

    Sason, I. & Wiechman, G., 2006, 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI. p. 344-348 5 p. 4115308. (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • On achievable rates and complexity of LDPC codes for parallel channels: Information-theoretic bounds and applications

    Sason, I. & Wiechman, G., 2006, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. p. 406-410 5 p. 4035992. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    1 Scopus citations

  • On the error exponents of improved tangential-sphere bounds

    Twitto, M. & Sason, I., 2006, 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI. p. 398-402 5 p. 4115320. (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Performance versus complexity per iteration for low-density parity-check codes: An Information-theoretic approach

    Sason, I. & Wiechman, G., 2006, Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on. 5755847. (Turbo Codes and Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Recent results on capacity-achieving codes for the erasure channel with bounded complexity

    Sason, I. & Pfister, H. D., 2006, 2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI. p. 339-343 5 p. 4115307. (IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • Tightened upper bounds on the ML decoding error probability of binary linear block codes

    Twitto, M., Sason, I. & Shamai, S., 2006, Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006. p. 714-718 5 p. 4036056. (IEEE International Symposium on Information Theory - Proceedings).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2005

    Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity

    Pfister, H. D. & Sason, I., 2005, 43rd Annual Allerton Conference on Communication, Control and Computing 2005. p. 30-44 15 p. (43rd Annual Allerton Conference on Communication, Control and Computing 2005; vol. 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Scopus citations

  • On the parity-check density and achievable rates of LDPC codes for memoryless binary-input output-symmetric channels

    Wiechman, G. & Sason, I., 2005, 43rd Annual Allerton Conference on Communication, Control and Computing 2005. p. 1747-1758 12 p. (43rd Annual Allerton Conference on Communication, Control and Computing 2005; vol. 4).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations
  • 2004

    Bounds on the Decoding Complexity of Punctured Codes on Graphs

    Pfister, H. D., Sason, I. & Urbanke, R., 2004, PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING. p. 481-491 11 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2002

    How Sparse Can Parity-Check Matrices of Binary Linear Codes Be, as a Function of their Gap to Capacity?

    Sason, I. & Urbanke, R., 2002, PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING. Vol. 40. p. 1140-1149 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2001

    On simple and tight upper bounds on the ML decoding error probability for block codes over interleaved fading channels

    Sason, I., Shamai, S. & Divsalar, D., 2001, Proceedings Sixth International Symposium on Communication Theory and Applications (ISCTA’01). p. 236-241 6 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review