Igal Sason

ORCID

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 54

Top Venues

CoRR

ISIT

IEEE Trans. Inf. Theory

Entropy

Publications

Igal Sason
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products. CoRR (2023)
Igal Sason
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products †. Entropy 25 (1) (2023)
Igal Sason
Divergence Measures: Mathematical Foundations and Applications in Information-Theoretic and Statistical Problems. Entropy 24 (5) (2022)
Igal Sason
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. CoRR (2022)
Igal Sason
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. Entropy 24 (5) (2022)
Igal Sason
A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs. Entropy 23 (3) (2021)
Robert Graczyk, Igal Sason
On Two-Stage Guessing. Inf. 12 (4) (2021)
Igal Sason
Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs. ISIT (2021)
Igal Sason
Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs. CoRR (2021)
Robert Graczyk, Igal Sason
On Two-Stage Guessing. CoRR (2021)
Igal Sason
On Strong Data-Processing and Majorization Inequalities with Applications to Coding Problems. CoRR (2021)
Neri Merhav, Igal Sason
Some Useful Integral Representations for Information-Theoretic Analyses. CoRR (2020)
Neri Merhav, Igal Sason
Some Useful Integral Representations for Information-Theoretic Analyses. Entropy 22 (6) (2020)
Igal Sason
An Information-Theoretic Proof of a Bound on the Number of Independent Sets in Bipartite Graphs. CoRR (2020)
Neri Merhav, Igal Sason
Exact Expressions in Source and Channel Coding Problems Using Integral Representations. ISIT (2020)
Tomohiro Nishiyama, Igal Sason
On Relations Between the Relative Entropy and χ2-Divergence, Generalizations and Applications. Entropy 22 (5) (2020)
Neri Merhav, Igal Sason
An Integral Representation of the Logarithmic Function with Applications in Information Theory. Entropy 22 (1) (2020)
Tomohiro Nishiyama, Igal Sason
-Divergence, Generalizations and Applications. CoRR (2020)
Igal Sason
On Data-Processing and Majorization Inequalities for f-Divergences with Applications. CoRR (2019)
Neri Merhav, Igal Sason
An Integral Representation of the Logarithmic Function with Applications in Information Theory. CoRR (2019)
Igal Sason
On Data-Processing and Majorization Inequalities for f-Divergences with Applications. Entropy 21 (10) (2019)
Igal Sason, Sergio Verdú
Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints. ISIT (2018)
Igal Sason, Sergio Verdú
Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures. CoRR (2018)
Igal Sason, Sergio Verdú
Arimoto-Rényi Conditional Entropy and Bayesian M-Ary Hypothesis Testing. IEEE Trans. Inf. Theory 64 (1) (2018)
Igal Sason
Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression. Entropy 20 (12) (2018)
Igal Sason
On f-Divergences: Integral Representations, Local Behavior, and Inequalities. CoRR (2018)
Igal Sason, Sergio Verdú
Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures. IEEE Trans. Inf. Theory 64 (6) (2018)
Igal Sason
-Divergences: Integral Representations, Local Behavior, and Inequalities. Entropy 20 (5) (2018)
Igal Sason
Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression. CoRR (2018)
Igal Sason, Sergio Verdú
Improved Bounds on Guessing Moments via Rényi Measures. ISIT (2018)
Igal Sason, Sergio Verdú
Arimoto-Rényi Conditional Entropy and Bayesian M-ary Hypothesis Testing. CoRR (2017)
Shai Ginzach, Neri Merhav, Igal Sason
Random-coding error exponent of variable-length codes with a single-bit noiseless feedback. ITW (2017)
Igal Sason, Sergio Verdú
Arimoto-Rényi conditional entropy and Bayesian hypothesis testing. ISIT (2017)
Eshed Ram, Igal Sason
On Rényi entropy power inequalities. ISIT (2016)
Eshed Ram, Igal Sason
On Rényi Entropy Power Inequalities. CoRR (2016)
Igal Sason, Sergio Verdú
f-Divergence Inequalities. IEEE Trans. Inf. Theory 62 (11) (2016)
Igal Sason, Sergio Verdú
f-Divergence Inequalities via Functional Domination. CoRR (2016)
M. Ashok Kumar, Igal Sason
On projections of the Rényi divergence on generalized convex sets. ISIT (2016)
Eshed Ram, Igal Sason
On Rényi Entropy Power Inequalities. IEEE Trans. Inf. Theory 62 (12) (2016)
Igal Sason
On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem. IEEE Trans. Inf. Theory 62 (1) (2016)
M. Ashok Kumar, Igal Sason
Projection Theorems for the Rényi Divergence on α-Convex Sets. IEEE Trans. Inf. Theory 62 (9) (2016)
Igal Sason, Sergio Verdú
Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabets. ITW Fall (2015)
Igal Sason
Tight Bounds for Symmetric Divergence Measures and a New Inequality Relating f-Divergences. CoRR (2015)
M. Ashok Kumar, Igal Sason
Projection Theorems for the Rényi Divergence on $α$-Convex Sets. CoRR (2015)
Igal Sason
An Improved Reverse Pinsker Inequality for Probability Distributions on a Finite Set. CoRR (2015)
Igal Sason
On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel. IEEE Trans. Inf. Theory 61 (7) (2015)
Marco Mondelli, Seyed Hamed Hassani, Igal Sason, Rüdiger L. Urbanke
Achieving Marton's Region for Broadcast Channels Using Polar Codes. IEEE Trans. Inf. Theory 61 (2) (2015)
Igal Sason
On Reverse Pinsker Inequalities. CoRR (2015)
Maxim Raginsky, Igal Sason
Concentration of Measure Inequalities and Their Communication and Information-Theoretic Applications. CoRR (2015)
Igal Sason, Sergio Verdú
Bounds among $f$-divergences. CoRR (2015)
Igal Sason
Tight bounds for symmetric divergence measures and a new inequality relating f-divergences. ITW (2015)
Igal Sason
On the Rényi divergence and the joint range of relative entropies. ISIT (2015)
Igal Sason
On the Rényi Divergence and a Related Problem on the Joint Range of Relative Entropies. CoRR (2015)
Igal Sason
Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding. IEEE Trans. Inf. Theory 61 (2) (2015)
Igal Sason
On the corner points of the capacity region of a two-user Gaussian interference channel. ISIT (2014)
Marco Mondelli, Seyed Hamed Hassani, Igal Sason, Rüdiger L. Urbanke
Achieving the Superposition and Binning Regions for Broadcast Channels Using Polar Codes. CoRR (2014)
Igal Sason
On Improved Bounds for Probability Metrics and $f$-Divergences. CoRR (2014)
Marco Mondelli, Seyed Hamed Hassani, Rüdiger L. Urbanke, Igal Sason
Achieving Marton's region for broadcast channels using polar codes. ISIT (2014)
Igal Sason
Entropy Bounds for Discrete Random Variables via Maximal Coupling. IEEE Trans. Inf. Theory 59 (11) (2013)
Maxim Raginsky, Igal Sason
Concentration of Measure Inequalities in Information Theory, Communications, and Coding. Found. Trends Commun. Inf. Theory 10 (1-2) (2013)
Igal Sason
Entropy bounds for discrete random variables via coupling. ISIT (2013)
Eran Hof, Igal Sason, Shlomo Shamai, Chao Tian
Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels. IEEE Trans. Inf. Theory 59 (3) (2013)
Maxim Raginsky, Igal Sason
Refined bounds on the empirical distribution of good channel codes via concentration inequalities. ISIT (2013)
Igal Sason
Improved lower bounds on the total variation distance and relative entropy for the Poisson approximation. ITA (2013)
Igal Sason
On the Corner Points of the Capacity Region of a Gaussian Interference Channel. CoRR (2013)
Igal Sason
On the corner points of the capacity region of a two-user Gaussian interference channel. Allerton (2013)
Igal Sason
Improved Lower Bounds on the Total Variation Distance and Relative Entropy for the Poisson Approximation CoRR (2013)
Kostis Xenoulis, Nicholas Kalouptsidis, Igal Sason
New achievable rates for nonlinear Volterra channels via martingale inequalities. ISIT (2012)
Igal Sason
Moderate deviations analysis of binary hypothesis testing. ISIT (2012)
Igal Sason
On the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method CoRR (2012)
Igal Sason
Tightened Exponential Bounds for Discrete Time, Conditionally Symmetric Martingales with Bounded Jumps CoRR (2012)
Igal Sason
Entropy Bounds for Discrete Random Variables via Coupling CoRR (2012)
Igal Sason
On the entropy of sums of Bernoulli random variables via the Chen-Stein method. ITW (2012)
Maxim Raginsky, Igal Sason
Concentration of Measure Inequalities in Information Theory, Communications and Coding CoRR (2012)
Igal Sason
On the Concentration of the Crest Factor for OFDM Signals CoRR (2011)
Igal Sason
Moderate Deviations Analysis of Binary Hypothesis Testing CoRR (2011)
Igal Sason, Ronen Eshel
On concentration of measures for LDPC code ensembles. ISIT (2011)
Igal Sason
On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory CoRR (2011)
Igal Sason
On the concentration of the crest factor for OFDM signals. ISWCS (2011)
Igal Sason
On Concentration and Revisited Large Deviations Analysis of Binary Hypothesis Testing CoRR (2011)
Igal Sason, Boaz Shuval
On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels. IEEE Trans. Inf. Theory 57 (8) (2011)
Eran Hof, Igal Sason, Shlomo Shamai
Polar coding for reliable communications over parallel channels. ITW (2010)
Igal Sason, Boaz Shuval
On universal LDPC code ensembles. ISIT (2010)
Eran Hof, Igal Sason, Shlomo Shamai
Performance bounds for erasure, list and decision feedback schemes with linear block codes. IEEE Trans. Inf. Theory 56 (8) (2010)
Eran Hof, Igal Sason, Shlomo Shamai
Polar Coding for Reliable Communications over Parallel Channels CoRR (2010)
Eran Hof, Igal Sason, Shlomo Shamai
Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels. IEEE Trans. Inf. Theory 55 (3) (2009)
Igal Sason
On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles. ISIT (2009)
Igal Sason
On universal properties of capacity-approaching LDPC code ensembles. IEEE Trans. Inf. Theory 55 (7) (2009)
Igal Sason, Gil Wiechman
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel. IEEE Trans. Inf. Theory 55 (6) (2009)
Igal Sason
Lower bounds on the graphical complexity of finite-length LDPC codes. ISIT (2009)
Igal Sason
Linear programming bounds on the degree distributions of LDPC code ensembles. ISIT (2009)
Igal Sason, Gil Wiechman
Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel. ISIT (2008)
Igal Sason, Gil Wiechman
Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598]. IEEE Trans. Inf. Theory 54 (7) (2008)
Gil Wiechman, Igal Sason
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels. IEEE Trans. Inf. Theory 54 (5) (2008)
Eran Hof, Igal Sason, Shlomo Shamai
Gallager-type bounds for non-binary linear block codes over memoryless symmetric channels. ITW (2008)
Igal Sason, Gil Wiechman
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe CoRR (2007)
Moshe Twitto, Igal Sason, Shlomo Shamai
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes. IEEE Trans. Inf. Theory 53 (4) (2007)
Igal Sason, Gil Wiechman
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications. IEEE Trans. Inf. Theory 53 (2) (2007)
Moshe Twitto, Igal Sason
On the Error Exponents of Improved Tangential Sphere Bounds. IEEE Trans. Inf. Theory 53 (3) (2007)
Henry D. Pfister, Igal Sason
Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity. IEEE Trans. Inf. Theory 53 (6) (2007)

Igal Sason.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Igal Sason