Igal Sason
Orcid: 0000-0001-5681-1273
According to our database1,
Igal Sason
authored at least 108 papers
between 1999 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products †.
Entropy, January, 2023
2022
Divergence Measures: Mathematical Foundations and Applications in Information-Theoretic and Statistical Problems.
Entropy, 2022
Entropy, 2022
2021
A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs.
Entropy, 2021
On Strong Data-Processing and Majorization Inequalities with Applications to Coding Problems.
CoRR, 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
On Relations Between the Relative Entropy and χ2-Divergence, Generalizations and Applications.
Entropy, 2020
Entropy, 2020
An Integral Representation of the Logarithmic Function with Applications in Information Theory.
Entropy, 2020
An Information-Theoretic Proof of a Bound on the Number of Independent Sets in Bipartite Graphs.
CoRR, 2020
On Relations Between the Relative entropy and χ<sup>2</sup>-Divergence, Generalizations and Applications.
CoRR, 2020
Exact Expressions in Source and Channel Coding Problems Using Integral Representations.
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
On Data-Processing and Majorization Inequalities for f-Divergences with Applications.
Entropy, 2019
2018
IEEE Trans. Inf. Theory, 2018
IEEE Trans. Inf. Theory, 2018
Tight Bounds on the Rényi Entropy via Majorization with Applications to Guessing and Compression.
Entropy, 2018
Entropy, 2018
CoRR, 2018
Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix Constraints.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
2017
Random-coding error exponent of variable-length codes with a single-bit noiseless feedback.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
2016
On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem.
IEEE Trans. Inf. Theory, 2016
IEEE Trans. Inf. Theory, 2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel.
IEEE Trans. Inf. Theory, 2015
Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding.
IEEE Trans. Inf. Theory, 2015
IEEE Trans. Inf. Theory, 2015
An Improved Reverse Pinsker Inequality for Probability Distributions on a Finite Set.
CoRR, 2015
On the Rényi Divergence and a Related Problem on the Joint Range of Relative Entropies.
CoRR, 2015
Concentration of Measure Inequalities and Their Communication and Information-Theoretic Applications.
CoRR, 2015
Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabets.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015
Tight bounds for symmetric divergence measures and a new inequality relating f-divergences.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
Achieving the Superposition and Binning Regions for Broadcast Channels Using Polar Codes.
CoRR, 2014
2013
IEEE Trans. Inf. Theory, 2013
IEEE Trans. Inf. Theory, 2013
Concentration of Measure Inequalities in Information Theory, Communications, and Coding.
Found. Trends Commun. Inf. Theory, 2013
CoRR, 2013
Improved lower bounds on the total variation distance and relative entropy for the Poisson approximation.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
Refined bounds on the empirical distribution of good channel codes via concentration inequalities.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2012
Tightened Exponential Bounds for Discrete Time, Conditionally Symmetric Martingales with Bounded Jumps
CoRR, 2012
Proceedings of the 2012 IEEE Information Theory Workshop, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
2011
IEEE Trans. Inf. Theory, 2011
On Concentration and Revisited Large Deviations Analysis of Binary Hypothesis Testing
CoRR, 2011
On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory
CoRR, 2011
Proceedings of the 8th International Symposium on Wireless Communication Systems, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
2010
Performance bounds for erasure, list and decision feedback schemes with linear block codes.
IEEE Trans. Inf. Theory, 2010
Proceedings of the 2010 IEEE Information Theory Workshop, 2010
Proceedings of the IEEE International Symposium on Information Theory, 2010
2009
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel.
IEEE Trans. Inf. Theory, 2009
IEEE Trans. Inf. Theory, 2009
Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels.
IEEE Trans. Inf. Theory, 2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
2008
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels.
IEEE Trans. Inf. Theory, 2008
Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598].
IEEE Trans. Inf. Theory, 2008
Gallager-type bounds for non-binary linear block codes over memoryless symmetric channels.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008
Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
2007
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications.
IEEE Trans. Inf. Theory, 2007
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes.
IEEE Trans. Inf. Theory, 2007
IEEE Trans. Inf. Theory, 2007
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications.
IEEE Trans. Inf. Theory, 2007
IEEE Trans. Inf. Theory, 2007
Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity.
IEEE Trans. Inf. Theory, 2007
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe
CoRR, 2007
2006
Found. Trends Commun. Inf. Theory, 2006
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
CoRR, 2006
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
CoRR, 2006
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
CoRR, 2006
Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations
CoRR, 2006
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
2005
IEEE Trans. Inf. Theory, 2005
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
CoRR, 2005
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview
CoRR, 2005
Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity
CoRR, 2005
Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity
CoRR, 2005
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
CoRR, 2005
Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes
CoRR, 2005
2004
Complexity Versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary Erasure Channel.
IEEE Trans. Inf. Theory, 2004
IEEE Trans. Inf. Theory, 2004
2003
Parity-check density versus performance of binary linear block codes over memorylesssymmetric channels.
IEEE Trans. Inf. Theory, 2003
Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels.
IEEE Trans. Commun., 2003
2002
IEEE Trans. Inf. Theory, 2002
On the asymptotic input-output weight distributions and thresholds of convolutionaland turbo-like encoders.
IEEE Trans. Inf. Theory, 2002
2001
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, 2001
2000
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, 2000
Improved upper bounds on the ensemble performance of ML decoded low density parity check codes.
IEEE Commun. Lett., 2000
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding.
Eur. Trans. Telecommun., 2000
Improved Upper Bounds on the ML Performance of Turbo Codes for Interleaved Rician Fading Channels with Comparison to Iterative Decoding.
Proceedings of the 2000 IEEE International Conference on Communications: Global Convergence Through Communications, 2000
1999
IEEE Trans. Inf. Theory, 1999
Ann. des Télécommunications, 1999