Bounds on the error probability ofml decoding for block and turbo-block codes. - Igal Sason; Shlomo Shamai (Shitz) (Ann. des Télécommunications, 1999)

On interleaved, differentially encoded convolutional codes. - Michael Peleg; Igal Sason; Shlomo Shamai; Avner Elia (IEEE Trans. Inf. Theory, 1999)

Improved Upper Bounds on the ML Performance of Turbo Codes for Interleaved Rician Fading Channels with Comparison to Iterative Decoding. - Igal Sason; Shlomo Shamai (ICC (2), 2000)

On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding. - Igal Sason; Shlomo Shamai (Eur. Trans. Telecommun., 2000)

Improved upper bounds on the ensemble performance of ML decoded low density parity check codes. - Igal Sason; Shlomo Shamai (IEEE Commun. Lett., 2000)

Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum. - Igal Sason; Shlomo Shamai (IEEE Trans. Inf. Theory, 2000)

On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes. - Igal Sason; Shlomo Shamai (IEEE Trans. Inf. Theory, 2001)

On the asymptotic input-output weight distributions and thresholds of convolutionaland turbo-like encoders. - Igal Sason; I. Emre Telatar; Rüdiger L. Urbanke (IEEE Trans. Inf. Theory, 2002)

Variations on the Gallager bounds, connections, and applications. - Shlomo Shamai; Igal Sason (IEEE Trans. Inf. Theory, 2002)

Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels. - Igal Sason; Shlomo Shamai; Dariush Divsalar (IEEE Trans. Commun., 2003)

Parity-check density versus performance of binary linear block codes over memorylesssymmetric channels. - Igal Sason; Rüdiger L. Urbanke (IEEE Trans. Inf. Theory, 2003)

Bounds on the decoding complexity of punctured codes on graphs - Henry D. Pfister; Igal Sason; Rüdiger L. Urbanke (CoRR, 2004)

On Achievable Rate Regions for the Gaussian Interference Channel. - Igal Sason (IEEE Trans. Inf. Theory, 2004)

Complexity Versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary Erasure Channel. - Igal Sason; Rüdiger L. Urbanke (IEEE Trans. Inf. Theory, 2004)

Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes - Gil Wiechman; Igal Sason (CoRR, 2005)

On the Parity-Check Density and Achievable Rates of LDPC Codes - Gil Wiechman; Igal Sason (CoRR, 2005)

On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing - Igal Sason; Gil Wiechman (CoRR, 2005)

Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity - Henry D. Pfister; Igal Sason (CoRR, 2005)

Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity - Henry D. Pfister; Igal Sason (CoRR, 2005)

Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview - Igal Sason; Shlomo Shamai (CoRR, 2005)

Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach - Igal Sason; Gil Wiechman (CoRR, 2005)

Capacity-achieving ensembles for the binary erasure channel with bounded complexity. - Henry D. Pfister; Igal Sason; Rüdiger L. Urbanke (IEEE Trans. Inf. Theory, 2005)

On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications. - Igal Sason; Gil Wiechman (ISIT, 2006)

Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations - Igal Sason; Idan Goldenberg (CoRR, 2006)

On the Error Exponents of Some Improved Tangential-Sphere Bounds - Moshe Twitto; Igal Sason (CoRR, 2006)

An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels - Gil Wiechman; Igal Sason (CoRR, 2006)

An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications - Gil Wiechman; Igal Sason (CoRR, 2006)

Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes - Igal Sason; Idan Goldenberg (CoRR, 2006)

Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial. - Igal Sason; Shlomo Shamai (Found. Trends Commun. Inf. Theory, 2006)

On Universal Properties of Capacity-Approaching LDPC Ensembles - Igal Sason (CoRR, 2007)

Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe - Igal Sason; Gil Wiechman (CoRR, 2007)

Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity. - Henry D. Pfister; Igal Sason (IEEE Trans. Inf. Theory, 2007)

Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes. - Igal Sason; Idan Goldenberg (IEEE Trans. Inf. Theory, 2007)

On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications. - Igal Sason; Gil Wiechman (IEEE Trans. Inf. Theory, 2007)

On the Error Exponents of Improved Tangential Sphere Bounds. - Moshe Twitto; Igal Sason (IEEE Trans. Inf. Theory, 2007)

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes. - Moshe Twitto; Igal Sason; Shlomo Shamai (IEEE Trans. Inf. Theory, 2007)

Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications. - Gil Wiechman; Igal Sason (IEEE Trans. Inf. Theory, 2007)

Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel. - Igal Sason; Gil Wiechman (ISIT, 2008)

Gallager-type bounds for non-binary linear block codes over memoryless symmetric channels. - Eran Hof; Igal Sason; Shlomo Shamai (ITW, 2008)

Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598]. - Igal Sason; Gil Wiechman (IEEE Trans. Inf. Theory, 2008)

An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels. - Gil Wiechman; Igal Sason (IEEE Trans. Inf. Theory, 2008)

On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles. - Igal Sason (ISIT, 2009)

Lower bounds on the graphical complexity of finite-length LDPC codes. - Igal Sason (ISIT, 2009)

Linear programming bounds on the degree distributions of LDPC code ensembles. - Igal Sason (ISIT, 2009)

Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels. - Eran Hof; Igal Sason; Shlomo Shamai (IEEE Trans. Inf. Theory, 2009)

On universal properties of capacity-approaching LDPC code ensembles. - Igal Sason (IEEE Trans. Inf. Theory, 2009)

Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel. - Igal Sason; Gil Wiechman (IEEE Trans. Inf. Theory, 2009)

On universal LDPC code ensembles. - Igal Sason; Boaz Shuval (ISIT, 2010)

Polar coding for reliable communications over parallel channels. - Eran Hof; Igal Sason; Shlomo Shamai (ITW, 2010)

Performance bounds for erasure, list and decision feedback schemes with linear block codes. - Eran Hof; Igal Sason; Shlomo Shamai (IEEE Trans. Inf. Theory, 2010)

On concentration of measures for LDPC code ensembles. - Igal Sason; Ronen Eshel (ISIT, 2011)

On the concentration of the crest factor for OFDM signals. - Igal Sason (ISWCS, 2011)

On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory - Igal Sason (CoRR, 2011)

On Concentration and Revisited Large Deviations Analysis of Binary Hypothesis Testing - Igal Sason (CoRR, 2011)

On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels. - Igal Sason; Boaz Shuval (IEEE Trans. Inf. Theory, 2011)

Moderate deviations analysis of binary hypothesis testing. - Igal Sason (ISIT, 2012)

New achievable rates for nonlinear Volterra channels via martingale inequalities. - Kostis Xenoulis; Nicholas Kalouptsidis; Igal Sason (ISIT, 2012)

On the entropy of sums of Bernoulli random variables via the Chen-Stein method. - Igal Sason (ITW, 2012)

Tightened Exponential Bounds for Discrete Time, Conditionally Symmetric Martingales with Bounded Jumps - Igal Sason (CoRR, 2012)

Refined bounds on the empirical distribution of good channel codes via concentration inequalities. - Maxim Raginsky; Igal Sason (ISIT, 2013)

Entropy bounds for discrete random variables via coupling. - Igal Sason (ISIT, 2013)

Improved lower bounds on the total variation distance and relative entropy for the Poisson approximation. - Igal Sason (ITA, 2013)

On the Corner Points of the Capacity Region of a Gaussian Interference Channel. - Igal Sason (CoRR, 2013)

Concentration of Measure Inequalities in Information Theory, Communications, and Coding. - Maxim Raginsky; Igal Sason (Found. Trends Commun. Inf. Theory, 2013)

Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels. - Eran Hof; Igal Sason; Shlomo Shamai; Chao Tian 002 (IEEE Trans. Inf. Theory, 2013)

Entropy Bounds for Discrete Random Variables via Maximal Coupling. - Igal Sason (IEEE Trans. Inf. Theory, 2013)

Achieving the Superposition and Binning Regions for Broadcast Channels Using Polar Codes. - Marco Mondelli; Seyed Hamed Hassani; Igal Sason; Rüdiger L. Urbanke (CoRR, 2014)

On Improved Bounds for Probability Metrics and $f$-Divergences. - Igal Sason (CoRR, 2014)

On the Rényi divergence and the joint range of relative entropies. - Igal Sason (ISIT, 2015)

Tight bounds for symmetric divergence measures and a new inequality relating f-divergences. - Igal Sason (ITW, 2015)

Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabets. - Igal Sason; Sergio Verdú (ITW Fall, 2015)

Concentration of Measure Inequalities and Their Communication and Information-Theoretic Applications. - Maxim Raginsky; Igal Sason (CoRR, 2015)

On the Rényi Divergence and a Related Problem on the Joint Range of Relative Entropies. - Igal Sason (CoRR, 2015)

An Improved Reverse Pinsker Inequality for Probability Distributions on a Finite Set. - Igal Sason (CoRR, 2015)

On Reverse Pinsker Inequalities. - Igal Sason (CoRR, 2015)

Bounds among $f$-divergences. - Igal Sason; Sergio Verdú (CoRR, 2015)

Achieving Marton's Region for Broadcast Channels Using Polar Codes. - Marco Mondelli; Seyed Hamed Hassani; Igal Sason; Rüdiger L. Urbanke (IEEE Trans. Inf. Theory, 2015)

Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding. - Igal Sason (IEEE Trans. Inf. Theory, 2015)

On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel. - Igal Sason (IEEE Trans. Inf. Theory, 2015)

On projections of the Rényi divergence on generalized convex sets. - M. Ashok Kumar; Igal Sason (ISIT, 2016)

f-Divergence Inequalities via Functional Domination. - Igal Sason; Sergio Verdú (CoRR, 2016)

Projection Theorems for the Rényi Divergence on α-Convex Sets. - M. Ashok Kumar; Igal Sason (IEEE Trans. Inf. Theory, 2016)

On Rényi Entropy Power Inequalities. - Eshed Ram; Igal Sason (IEEE Trans. Inf. Theory, 2016)

On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem. - Igal Sason (IEEE Trans. Inf. Theory, 2016)

f-Divergence Inequalities. - Igal Sason; Sergio Verdú (IEEE Trans. Inf. Theory, 2016)

Arimoto-Rényi conditional entropy and Bayesian hypothesis testing. - Igal Sason; Sergio Verdú (ISIT, 2017)

Random-coding error exponent of variable-length codes with a single-bit noiseless feedback. - Shai Ginzach; Neri Merhav; Igal Sason (ITW, 2017)

Improved Bounds on Guessing Moments via Rényi Measures. - Igal Sason; Sergio Verdú (ISIT, 2018)

Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints. - Igal Sason; Sergio Verdú (ISIT, 2018)

On f-Divergences: Integral Representations, Local Behavior, and Inequalities. - Igal Sason (CoRR, 2018)

On f-Divergences: Integral Representations, Local Behavior, and Inequalities. - Igal Sason (Entropy, 2018)

Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression. - Igal Sason (Entropy, 2018)

Arimoto-Rényi Conditional Entropy and Bayesian M-Ary Hypothesis Testing. - Igal Sason; Sergio Verdú (IEEE Trans. Inf. Theory, 2018)

Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures. - Igal Sason; Sergio Verdú (IEEE Trans. Inf. Theory, 2018)

On Data-Processing and Majorization Inequalities for f-Divergences with Applications. - Igal Sason (Entropy, 2019)

Exact Expressions in Source and Channel Coding Problems Using Integral Representations. - Neri Merhav; Igal Sason (ISIT, 2020)

On Relations Between the Relative entropy and χ2-Divergence, Generalizations and Applications. - Tomohiro Nishiyama; Igal Sason (CoRR, 2020)

An Information-Theoretic Proof of a Bound on the Number of Independent Sets in Bipartite Graphs. - Igal Sason (CoRR, 2020)

An Integral Representation of the Logarithmic Function with Applications in Information Theory. - Neri Merhav; Igal Sason (Entropy, 2020)

Some Useful Integral Representations for Information-Theoretic Analyses. - Neri Merhav; Igal Sason (Entropy, 2020)

On Relations Between the Relative Entropy and χ2-Divergence, Generalizations and Applications. - Tomohiro Nishiyama; Igal Sason (Entropy, 2020)

Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs. - Igal Sason (ISIT, 2021)

On Strong Data-Processing and Majorization Inequalities with Applications to Coding Problems. - Igal Sason (CoRR, 2021)

A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs. - Igal Sason (Entropy, 2021)

On Two-Stage Guessing. - Robert Graczyk; Igal Sason (Inf., 2021)

Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. - Igal Sason (Entropy, 2022)

Divergence Measures: Mathematical Foundations and Applications in Information-Theoretic and Statistical Problems. - Igal Sason (Entropy, 2022)

Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products †. - Igal Sason (Entropy, 2023)

On Counting H-Intersecting Families and Graph Homomorphisms. - Igal Sason (CoRR, 2025)

Schrijver's θ-function is not an upper bound on the Shannon capacity of a graph: a counterexample. - Igal Sason (CoRR, 2025)