World's Best Scientists 2026 revealed!

Research.com Recognitions

  • 2019 - IEEE Fellow For contributions to the achievable rate region of the Gaussian interference channel and the analysis of low-complexity capacity-achieving linear codes

Overview

Igal Sason is affiliated with the Technion - Israel Institute of Technology in Israel. Their research predominantly spans the fields of Mathematics and Computer Science. The main areas of study include Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Artificial Intelligence, and Statistical and Nonlinear Physics.

The scientist's work covers several specialized topics such as:

  • Graph theory and applications
  • Limits and Structures in Graph Theory
  • Advanced Graph Theory Research
  • Graph Labeling and Dimension Problems
  • Statistical Mechanics and Entropy
  • Distributed Sensor Networks and Detection Algorithms
  • Sparse and Compressive Sensing Techniques

Recent publications by Igal Sason include:

  • "Divergence Measures: Mathematical Foundations and Applications in Information-Theoretic and Statistical Problems," 2022, Entropy
  • "Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products †," 2023, Entropy
  • "Observations on graph invariants with the Lovász $ \\vartheta $-function," 2024, AIMS Mathematics
  • "A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs," 2021, Entropy

Other relevant publications linked to their research topics include:

  • "On Relations Between the Relative Entropy and χ2-Divergence, Generalizations and Applications," 2020, Entropy (authored by Tomohiro Nishiyama)

Frequently appearing publication venues with contributions include:

  • arXiv (Cornell University)
  • Entropy
  • AIMS Mathematics
  • Mathematics
  • MDPI (MDPI AG)

Igal Sason has collaborated with a number of co-authors on various papers. Notable frequent co-authors are:

  • Н. Крупник
  • Suleiman Hamud
  • Abraham Berman
  • Robert Graczyk
  • Tomohiro Nishiyama

In 2019, the scientist was recognized as an IEEE Fellow for contributions to the achievable rate region of the Gaussian interference channel and the analysis of low-complexity capacity-achieving linear codes.

Best Publications

  • Concentration of Measure Inequalities in Information Theory, Communications and Coding

    Maxim Raginsky;Igal Sason

  • On achievable rate regions for the Gaussian interference channel

    I. Sason

  • $f$ -Divergence Inequalities

    Igal Sason;Sergio Verdu

  • Capacity-achieving ensembles for the binary erasure channel with bounded complexity

    H.D. Pfister;I. Sason;R. Urbanke

  • Performance Analysis of Linear Codes Under Maximum-Likelihood Decoding: A Tutorial

    Igal Sason;Shlomo Shamai

  • Variations on the Gallager bounds, connections, and applications

    S. Shamai;I. Sason

  • Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum

    I. Sason;S. Shamai

  • Parity-check density versus performance of binary linear block codes over memoryless symmetric channels

    I. Sason;R. Urbanke

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

    G. Wiechman;I. Sason

  • Achieving Marton’s Region for Broadcast Channels Using Polar Codes

    Marco Mondelli;Seyed Hamed Hassani;Igal Sason;Rudiger L. Urbanke

  • Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing

    Igal Sason;Sergio Verdu

  • Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity

    H.D. Pfister;I. Sason

  • Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity ¤

    Henry D. Pfister;Igal Sason

  • On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes

    I. Sason;S. Shamai

  • On interleaved, differentially encoded convolutional codes

    M. Peleg;I. Sason;S. Shamai;A. Elia

  • Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures

    Igal Sason;Sergio Verdu

  • Entropy Bounds for Discrete Random Variables via Maximal Coupling

    Igal Sason

  • Achieving Marton's Region for Broadcast Channels Using Polar Codes

    Marco Mondelli;S. Hamed Hassani;Igal Sason;Rüdiger Urbanke

  • Concentration of Measure Inequalities in Information Theory, Communications, and Coding: Second Edition

    Maxim Raginsky;Igal Sason

  • Improved Bounds on Lossless Source Coding and Guessing Moments via R'{e}nyi Measures

    Igal Sason;Sergio Verdú

Frequent Co-Authors

Shlomo Shamai
Shlomo Shamai Technion – Israel Institute of Technology
Sergio Verdu
Sergio Verdu Princeton University
Rudiger Urbanke
Rudiger Urbanke École Polytechnique Fédérale de Lausanne
Henry D. Pfister
Henry D. Pfister Duke University
Neri Merhav
Neri Merhav Technion – Israel Institute of Technology
Chao Tian
Chao Tian Texas A&M University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science can offer flexible options for a wide range of students. Whether you’re just starting your academic journey or seeking specialized knowledge, there are multiple pathways to consider.

For those looking to fast-track their entry into tech, pursuing an associate degree online provides foundational skills and can be a stepping stone toward further education or immediate employment.

Students mindful of budget constraints may benefit from researching the cheapest online degrees, which deliver quality programs at accessible tuition rates. Additionally, if academic history is a concern, there are online colleges that accept low gpa, making it possible for more learners to pursue their goals.

As you plan your career, you might also explore the most in demand masters degrees in fields like computer science, data analytics, and cybersecurity. These advanced degrees can open doors to high-growth roles and leadership opportunities in tech.

Best Scientists Citing Igal Sason

Trending Scientists