Person:383868: Difference between revisions

From MaRDI portal
Person:383868
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Igal Sason to Igal Sason: Duplicate
 
(No difference)

Latest revision as of 13:47, 9 December 2023

Available identifiers

zbMath Open sason.igalMaRDI QIDQ383868

List of research outcomes





PublicationDate of PublicationType
Observations on the Lov\'asz $\theta$-Function, Graph Capacity, Eigenvalues, and Strong Products2023-01-07Paper
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory2022-04-28Paper
Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs2021-06-14Paper
On Two-Stage Guessing2021-04-09Paper
A Generalized Information-Theoretic Approach for Bounding the Number of Independent Sets in Bipartite Graphs2020-12-22Paper
Some Useful Integral Representations for Information-Theoretic Analyses2020-05-12Paper
On Relations Between the Relative entropy and $\chi^2$-Divergence, Generalizations and Applications2020-04-23Paper
An Integral Representation of the Logarithmic Function with Applications in Information Theory2019-12-12Paper
On Data-Processing and Majorization Inequalities for $f$-Divergences with Applications2019-11-06Paper
Tight Bounds on the R\'enyi Entropy via Majorization with Applications to Guessing and Compression2018-12-08Paper
Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures2018-09-14Paper
Arimoto–Rényi Conditional Entropy and Bayesian $M$ -Ary Hypothesis Testing2018-06-27Paper
On $f$-Divergences: Integral Representations, Local Behavior, and Inequalities2018-04-17Paper
Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels2017-08-08Paper
Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel2017-08-08Paper
On Universal Properties of Capacity-Approaching LDPC Code Ensembles2017-08-08Paper
Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes2017-07-27Paper
On Universal LDPC Code Ensembles Over Memoryless Symmetric Channels2017-07-12Paper
Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels2017-06-08Paper
Entropy Bounds for Discrete Random Variables via Maximal Coupling2017-06-08Paper
On Rényi Entropy Power Inequalities2017-04-28Paper
$f$ -Divergence Inequalities2017-04-28Paper
Projection Theorems for the Rényi Divergence on $\alpha $ -Convex Sets2017-04-28Paper
On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem2017-04-28Paper
On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel2017-04-28Paper
Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding2017-04-28Paper
Achieving Marton’s Region for Broadcast Channels Using Polar Codes2017-04-28Paper
$f$-Divergence Inequalities via Functional Domination2016-10-28Paper
Concentration of Measure Inequalities and Their Communication and Information-Theoretic Applications2015-10-10Paper
On Reverse Pinsker Inequalities2015-03-24Paper
Upper Bounds on the Relative Entropy and R\'enyi Divergence as a Function of Total Variation Distance for Finite Alphabets2015-03-11Paper
Improved lower bounds on the total variation distance for the Poisson approximation2014-02-19Paper
Concentration of Measure Inequalities in Information Theory, Communications, and Coding2014-01-08Paper
Tightened exponential bounds for discrete-time conditionally symmetric martingales with bounded jumps2013-12-06Paper
On the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method2012-07-02Paper
An Information-Theoretic Perspective of the Poisson Approximation via the Chen-Stein Method2012-06-28Paper
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels2009-02-24Paper
Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598]2009-02-24Paper
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity2008-12-21Paper
On Achievable Rate Regions for the Gaussian Interference Channel2008-12-21Paper
Parity-check density versus performance of binary linear block codes over memoryless symmetric channels2008-12-21Paper
Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel2008-12-21Paper
Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity2008-12-21Paper
On the Error Exponents of Improved Tangential Sphere Bounds2008-12-21Paper
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications2008-12-21Paper
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications2008-12-21Paper
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes2008-12-21Paper
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes2008-12-21Paper
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial2008-09-01Paper
Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial2007-02-23Paper
Variations on the Gallager bounds, connections, and applications2005-05-11Paper
On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders2005-05-11Paper
On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes2002-08-04Paper
Variations on the Gallager bounds with some applications2002-01-06Paper
On interleaved, differentially encoded convolutional codes2000-09-07Paper
Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum2000-09-07Paper
Observations on Graph Invariants with the Lov\'asz $\vartheta$-FunctionN/APaper

Research outcomes over time

This page was built for person: Igal Sason