Igal Sason

141 papers B 29Misc 1Journal 107Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Advances in the Shannon Capacity of Graphs.
CoRR
Nitay Lavi, Igal Sason
2025 J jnl
On Counting H-Intersecting Families and Graph Homomorphisms.
CoRR
Igal Sason
2025 J jnl
Schrijver's θ-function is not an upper bound on the Shannon capacity of a graph: a counterexample.
CoRR
Igal Sason
2023 J jnl
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products †.
Entropy
Igal Sason
2023 J jnl
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products.
CoRR
Igal Sason
2022 J jnl
Divergence Measures: Mathematical Foundations and Applications in Information-Theoretic and Statistical Problems.
Entropy
Igal Sason
2022 J jnl
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory.
CoRR
Igal Sason
2022 J jnl
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory.
Entropy
Igal Sason
2021 J jnl
A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs.
Entropy
Igal Sason
2021 B conf
Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs.
ISIT
Igal Sason
2021 J jnl
Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs.
CoRR
Igal Sason
2021 J jnl
On Strong Data-Processing and Majorization Inequalities with Applications to Coding Problems.
CoRR
Igal Sason
2021 J jnl
On Two-Stage Guessing.
CoRR
Robert Graczyk, Igal Sason
2021 J jnl
On Two-Stage Guessing.
Inf.
Robert Graczyk, Igal Sason
2020 J jnl
An Information-Theoretic Proof of a Bound on the Number of Independent Sets in Bipartite Graphs.
CoRR
Igal Sason
2020 J jnl
An Integral Representation of the Logarithmic Function with Applications in Information Theory.
Entropy
Neri Merhav, Igal Sason
2020 B conf
Exact Expressions in Source and Channel Coding Problems Using Integral Representations.
ISIT
Neri Merhav, Igal Sason
2020 J jnl
On Relations Between the Relative Entropy and χ2-Divergence, Generalizations and Applications.
Entropy
Tomohiro Nishiyama, Igal Sason
2020 J jnl
On Relations Between the Relative entropy and χ
CoRR
Tomohiro Nishiyama, Igal Sason
2020 J jnl
Some Useful Integral Representations for Information-Theoretic Analyses.
CoRR
Neri Merhav, Igal Sason
2020 J jnl
Some Useful Integral Representations for Information-Theoretic Analyses.
Entropy
Neri Merhav, Igal Sason
2019 J jnl
An Integral Representation of the Logarithmic Function with Applications in Information Theory.
CoRR
Neri Merhav, Igal Sason
2019 J jnl
On Data-Processing and Majorization Inequalities for f-Divergences with Applications.
CoRR
Igal Sason
2019 J jnl
On Data-Processing and Majorization Inequalities for f-Divergences with Applications.
Entropy
Igal Sason
2018 J jnl
Arimoto-Rényi Conditional Entropy and Bayesian M-Ary Hypothesis Testing.
IEEE Trans. Inf. Theory
Igal Sason, Sergio Verdú
2018 B conf
Improved Bounds on Guessing Moments via Rényi Measures.
ISIT
Igal Sason, Sergio Verdú
2018 J jnl
Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures.
CoRR
Igal Sason, Sergio Verdú
2018 J jnl
Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures.
IEEE Trans. Inf. Theory
Igal Sason, Sergio Verdú
2018 B conf
Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints.
ISIT
Igal Sason, Sergio Verdú
2018 J jnl
On
Entropy
Igal Sason
2018 J jnl
On f-Divergences: Integral Representations, Local Behavior, and Inequalities.
CoRR
Igal Sason
2018 J jnl
Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression.
CoRR
Igal Sason
2018 J jnl
Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression.
Entropy
Igal Sason
2017 J jnl
Arimoto-Rényi Conditional Entropy and Bayesian M-ary Hypothesis Testing.
CoRR
Igal Sason, Sergio Verdú
2017 B conf
Arimoto-Rényi conditional entropy and Bayesian hypothesis testing.
ISIT
Igal Sason, Sergio Verdú
2017 B conf
Random-coding error exponent of variable-length codes with a single-bit noiseless feedback.
ITW
Shai Ginzach, Neri Merhav, Igal Sason
2016 J jnl
On Rényi Entropy Power Inequalities.
CoRR
Eshed Ram, Igal Sason
2016 J jnl
On Rényi Entropy Power Inequalities.
IEEE Trans. Inf. Theory
Eshed Ram, Igal Sason
2016 B conf
On Rényi entropy power inequalities.
ISIT
Eshed Ram, Igal Sason
2016 B conf
On projections of the Rényi divergence on generalized convex sets.
ISIT
M. Ashok Kumar, Igal Sason
2016 J jnl
On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem.
IEEE Trans. Inf. Theory
Igal Sason
2016 J jnl
Projection Theorems for the Rényi Divergence on α-Convex Sets.
IEEE Trans. Inf. Theory
M. Ashok Kumar, Igal Sason
2016 J jnl
f-Divergence Inequalities via Functional Domination.
CoRR
Igal Sason, Sergio Verdú
2016 J jnl
f-Divergence Inequalities.
IEEE Trans. Inf. Theory
Igal Sason, Sergio Verdú
2015 J jnl
Achieving Marton's Region for Broadcast Channels Using Polar Codes.
IEEE Trans. Inf. Theory
Marco Mondelli, Seyed Hamed Hassani, Igal Sason, Rüdiger L. Urbanke
2015 J jnl
An Improved Reverse Pinsker Inequality for Probability Distributions on a Finite Set.
CoRR
Igal Sason
2015 J jnl
Bounds among $f$-divergences.
CoRR
Igal Sason, Sergio Verdú
2015 J jnl
Concentration of Measure Inequalities and Their Communication and Information-Theoretic Applications.
CoRR
Maxim Raginsky, Igal Sason
2015 J jnl
On Reverse Pinsker Inequalities.
CoRR
Igal Sason
2015 J jnl
On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel.
IEEE Trans. Inf. Theory
Igal Sason
2015 J jnl
On the Rényi Divergence and a Related Problem on the Joint Range of Relative Entropies.
CoRR
Igal Sason
2015 B conf
On the Rényi divergence and the joint range of relative entropies.
ISIT
Igal Sason
2015 J jnl
Projection Theorems for the Rényi Divergence on $α$-Convex Sets.
CoRR
M. Ashok Kumar, Igal Sason
2015 J jnl
Tight Bounds for Symmetric Divergence Measures and a New Inequality Relating f-Divergences.
CoRR
Igal Sason
2015 J jnl
Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding.
IEEE Trans. Inf. Theory
Igal Sason
2015 B conf
Tight bounds for symmetric divergence measures and a new inequality relating f-divergences.
ITW
Igal Sason
2015 — conf
Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabets.
ITW Fall
Igal Sason, Sergio Verdú
2014 B conf
Achieving Marton's region for broadcast channels using polar codes.
ISIT
Marco Mondelli, Seyed Hamed Hassani, Rüdiger L. Urbanke, Igal Sason
2014 J jnl
Achieving the Superposition and Binning Regions for Broadcast Channels Using Polar Codes.
CoRR
Marco Mondelli, Seyed Hamed Hassani, Igal Sason, Rüdiger L. Urbanke
2014 J jnl
On Improved Bounds for Probability Metrics and $f$-Divergences.
CoRR
Igal Sason
2014 B conf
On the corner points of the capacity region of a two-user Gaussian interference channel.
ISIT
Igal Sason
2013 J jnl
Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels.
IEEE Trans. Inf. Theory
Eran Hof, Igal Sason, Shlomo Shamai, Chao Tian
2013 J jnl
Concentration of Measure Inequalities in Information Theory, Communications, and Coding.
Found. Trends Commun. Inf. Theory
Maxim Raginsky, Igal Sason
2013 J jnl
Entropy Bounds for Discrete Random Variables via Maximal Coupling.
IEEE Trans. Inf. Theory
Igal Sason
2013 B conf
Entropy bounds for discrete random variables via coupling.
ISIT
Igal Sason
2013 J jnl
Improved Lower Bounds on the Total Variation Distance and Relative Entropy for the Poisson Approximation
CoRR
Igal Sason
2013 Misc conf
Improved lower bounds on the total variation distance and relative entropy for the Poisson approximation.
ITA
Igal Sason
2013 J jnl
On the Corner Points of the Capacity Region of a Gaussian Interference Channel.
CoRR
Igal Sason
2013 — conf
On the corner points of the capacity region of a two-user Gaussian interference channel.
Allerton
Igal Sason
2013 B conf
Refined bounds on the empirical distribution of good channel codes via concentration inequalities.
ISIT
Maxim Raginsky, Igal Sason
2012 J jnl
Concentration of Measure Inequalities in Information Theory, Communications and Coding
CoRR
Maxim Raginsky, Igal Sason
2012 J jnl
Entropy Bounds for Discrete Random Variables via Coupling
CoRR
Igal Sason
2012 B conf
Moderate deviations analysis of binary hypothesis testing.
ISIT
Igal Sason
2012 B conf
New achievable rates for nonlinear Volterra channels via martingale inequalities.
ISIT
Kostis Xenoulis, Nicholas Kalouptsidis, Igal Sason
2012 J jnl
On the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method
CoRR
Igal Sason
2012 B conf
On the entropy of sums of Bernoulli random variables via the Chen-Stein method.
ITW
Igal Sason
2012 J jnl
Tightened Exponential Bounds for Discrete Time, Conditionally Symmetric Martingales with Bounded Jumps
CoRR
Igal Sason
2011 J jnl
Moderate Deviations Analysis of Binary Hypothesis Testing
CoRR
Igal Sason
2011 J jnl
On Concentration and Revisited Large Deviations Analysis of Binary Hypothesis Testing
CoRR
Igal Sason
2011 J jnl
On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory
CoRR
Igal Sason
2011 J jnl
On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels.
IEEE Trans. Inf. Theory
Igal Sason, Boaz Shuval
2011 B conf
On concentration of measures for LDPC code ensembles.
ISIT
Igal Sason, Ronen Eshel
2011 J jnl
On the Concentration of the Crest Factor for OFDM Signals
CoRR
Igal Sason
2011 — conf
On the concentration of the crest factor for OFDM signals.
ISWCS
Igal Sason
2010 B conf
On universal LDPC code ensembles.
ISIT
Igal Sason, Boaz Shuval
2010 J jnl
Performance bounds for erasure, list and decision feedback schemes with linear block codes.
IEEE Trans. Inf. Theory
Eran Hof, Igal Sason, Shlomo Shamai
2010 J jnl
Polar Coding for Reliable Communications over Parallel Channels
CoRR
Eran Hof, Igal Sason, Shlomo Shamai
2010 B conf
Polar coding for reliable communications over parallel channels.
ITW
Eran Hof, Igal Sason, Shlomo Shamai
2009 J jnl
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel.
IEEE Trans. Inf. Theory
Igal Sason, Gil Wiechman
2009 B conf
Linear programming bounds on the degree distributions of LDPC code ensembles.
ISIT
Igal Sason
2009 B conf
Lower bounds on the graphical complexity of finite-length LDPC codes.
ISIT
Igal Sason
2009 B conf
On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles.
ISIT
Igal Sason
2009 J jnl
On universal properties of capacity-approaching LDPC code ensembles.
IEEE Trans. Inf. Theory
Igal Sason
2009 J jnl
Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels.
IEEE Trans. Inf. Theory
Eran Hof, Igal Sason, Shlomo Shamai
2008 J jnl
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels.
IEEE Trans. Inf. Theory
Gil Wiechman, Igal Sason
2008 B conf
Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel.
ISIT
Igal Sason, Gil Wiechman
2008 J jnl
Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598].
IEEE Trans. Inf. Theory
Igal Sason, Gil Wiechman
2008 B conf
Gallager-type bounds for non-binary linear block codes over memoryless symmetric channels.
ITW
Eran Hof, Igal Sason, Shlomo Shamai
2007 J jnl
Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity.
IEEE Trans. Inf. Theory
Henry D. Pfister, Igal Sason
2007 J jnl
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe
CoRR
Igal Sason, Gil Wiechman
2007 J jnl
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes.
IEEE Trans. Inf. Theory
Igal Sason, Idan Goldenberg
2007 J jnl
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications.
IEEE Trans. Inf. Theory
Igal Sason, Gil Wiechman
2007 J jnl
On Universal Properties of Capacity-Approaching LDPC Ensembles
CoRR
Igal Sason
2007 J jnl
On the Error Exponents of Improved Tangential Sphere Bounds.
IEEE Trans. Inf. Theory
Moshe Twitto, Igal Sason
2007 J jnl
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications.
IEEE Trans. Inf. Theory
Gil Wiechman, Igal Sason
2007 J jnl
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes.
IEEE Trans. Inf. Theory
Moshe Twitto, Igal Sason, Shlomo Shamai
2006 J jnl
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
CoRR
Gil Wiechman, Igal Sason
2006 J jnl
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
CoRR
Gil Wiechman, Igal Sason
2006 J jnl
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
CoRR
Igal Sason, Idan Goldenberg
2006 J jnl
Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations
CoRR
Igal Sason, Idan Goldenberg
2006 B conf
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications.
ISIT
Igal Sason, Gil Wiechman
2006 J jnl
On the Error Exponents of Some Improved Tangential-Sphere Bounds
CoRR
Moshe Twitto, Igal Sason
2006 J jnl
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial.
Found. Trends Commun. Inf. Theory
Igal Sason, Shlomo Shamai
2006 J jnl
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
CoRR
Moshe Twitto, Igal Sason, Shlomo Shamai
2006 B conf
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes.
ISIT
Moshe Twitto, Igal Sason, Shlomo Shamai
2005 J jnl
Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity
CoRR
Henry D. Pfister, Igal Sason
2005 J jnl
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview
CoRR
Igal Sason, Shlomo Shamai
2005 J jnl
Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity
CoRR
Henry D. Pfister, Igal Sason
2005 J jnl
Capacity-achieving ensembles for the binary erasure channel with bounded complexity.
IEEE Trans. Inf. Theory
Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke
2005 J jnl
Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes
CoRR
Gil Wiechman, Igal Sason
2005 J jnl
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
CoRR
Igal Sason, Gil Wiechman
2005 J jnl
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
CoRR
Igal Sason, Gil Wiechman
2005 J jnl
On the Parity-Check Density and Achievable Rates of LDPC Codes
CoRR
Gil Wiechman, Igal Sason
2005 J jnl
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
CoRR
Igal Sason, Gil Wiechman
2004 J jnl
Bounds on the decoding complexity of punctured codes on graphs
CoRR
Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke
2004 J jnl
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
CoRR
Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke
2004 B conf
Capacity-achieving ensembles for the binary erasure channel with bounded complexity.
ISIT
Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke
2004 J jnl
Complexity Versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary Erasure Channel.
IEEE Trans. Inf. Theory
Igal Sason, Rüdiger L. Urbanke
2004 J jnl
On Achievable Rate Regions for the Gaussian Interference Channel.
IEEE Trans. Inf. Theory
Igal Sason
2004 B conf
On achievable rate regions for the Gaussian interference channel.
ISIT
Igal Sason
2003 J jnl
Parity-check density versus performance of binary linear block codes over memorylesssymmetric channels.
IEEE Trans. Inf. Theory
Igal Sason, Rüdiger L. Urbanke
2003 J jnl
Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels.
IEEE Trans. Commun.
Igal Sason, Shlomo Shamai, Dariush Divsalar
2002 J jnl
On the asymptotic input-output weight distributions and thresholds of convolutionaland turbo-like encoders.
IEEE Trans. Inf. Theory
Igal Sason, I. Emre Telatar, Rüdiger L. Urbanke
2002 J jnl
Variations on the Gallager bounds, connections, and applications.
IEEE Trans. Inf. Theory
Shlomo Shamai, Igal Sason
2001 J jnl
On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes.
IEEE Trans. Inf. Theory
Igal Sason, Shlomo Shamai
2000 — conf
Improved Upper Bounds on the ML Performance of Turbo Codes for Interleaved Rician Fading Channels with Comparison to Iterative Decoding.
ICC (2)
Igal Sason, Shlomo Shamai
2000 J jnl
Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum.
IEEE Trans. Inf. Theory
Igal Sason, Shlomo Shamai
2000 J jnl
Improved upper bounds on the ensemble performance of ML decoded low density parity check codes.
IEEE Commun. Lett.
Igal Sason, Shlomo Shamai
2000 J jnl
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding.
Eur. Trans. Telecommun.
Igal Sason, Shlomo Shamai
1999 J jnl
Bounds on the error probability ofml decoding for block and turbo-block codes.
Ann. des Télécommunications
Igal Sason, Shlomo Shamai (Shitz)
1999 J jnl
On interleaved, differentially encoded convolutional codes.
IEEE Trans. Inf. Theory
Michael Peleg, Igal Sason, Shlomo Shamai, Avner Elia