pith. sign in

Igal Sason

Identifiers

  • name variant Igal Sason 0.60 · backfill

Papers (41)

  1. The Lov\'{a}sz Local Lemma: Fundamentals, Applications, and Perspectives math.CO · 2026 · author #1
  2. Tight Bounds on the R\'enyi Entropy via Majorization with Applications to Guessing and Compression cs.IT · 2018 · author #1
  3. On $f$-Divergences: Integral Representations, Local Behavior, and Inequalities cs.IT · 2018 · author #1
  4. Improved Bounds on Lossless Source Coding and Guessing Moments via R\'enyi Measures cs.IT · 2018 · author #1
  5. Arimoto-R\'enyi Conditional Entropy and Bayesian $M$-ary Hypothesis Testing cs.IT · 2017 · author #1
  6. $f$-Divergence Inequalities via Functional Domination cs.IT · 2016 · author #1
  7. On Renyi Entropy Power Inequalities cs.IT · 2016 · author #2
  8. Projection Theorems for the R\'enyi Divergence on $\alpha$-Convex Sets cs.IT · 2015 · author #2
  9. Concentration of Measure Inequalities and Their Communication and Information-Theoretic Applications cs.IT · 2015 · author #2
  10. $f$-divergence Inequalities cs.IT · 2015 · author #1
  11. On Reverse Pinsker Inequalities cs.IT · 2015 · author #1
  12. Upper Bounds on the Relative Entropy and R\'enyi Divergence as a Function of Total Variation Distance for Finite Alphabets cs.IT · 2015 · author #1
  13. Tight Bounds for Symmetric Divergence Measures and a New Inequality Relating $f$-Divergences cs.IT · 2015 · author #1
  14. On the Renyi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem cs.IT · 2015 · author #1
  15. Tight Bounds for Symmetric Divergence Measures and a Refined Bound for Lossless Source Coding cs.IT · 2014 · author #1
  16. Achieving Marton's Region for Broadcast Channels Using Polar Codes cs.IT · 2014 · author #3
  17. On the Corner Points of the Capacity Region of a Two-User Gaussian Interference Channel cs.IT · 2013 · author #1
  18. Improved Lower Bounds on the Total Variation Distance for the Poisson Approximation cs.IT · 2013 · author #1
  19. Concentration of Measure Inequalities in Information Theory, Communications and Coding (Second Edition) cs.IT · 2012 · author #2
  20. Entropy Bounds for Discrete Random Variables via Maximal Coupling cs.IT · 2012 · author #1
  21. On the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method cs.IT · 2012 · author #1
  22. An Information-Theoretic Perspective of the Poisson Approximation via the Chen-Stein Method cs.IT · 2012 · author #1
  23. Tightened Exponential Bounds for Discrete Time, Conditionally Symmetric Martingales with Bounded Jumps math.PR · 2012 · author #1
  24. Moderate Deviations Analysis of Binary Hypothesis Testing cs.IT · 2011 · author #1
  25. On Concentration and Revisited Large Deviations Analysis of Binary Hypothesis Testing cs.IT · 2011 · author #1
  26. On the Concentration of the Crest Factor for OFDM Signals cs.IT · 2011 · author #1
  27. On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory cs.IT · 2011 · author #1
  28. Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels cs.IT · 2010 · author #2
  29. Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe cs.IT · 2007 · author #1
  30. On Universal Properties of Capacity-Approaching LDPC Ensembles cs.IT · 2007 · author #1
  31. Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes cs.IT · 2006 · author #1
  32. An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications cs.IT · 2006 · author #2
  33. An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels cs.IT · 2006 · author #2
  34. On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications cs.IT · 2005 · author #1
  35. Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach cs.IT · 2005 · author #1
  36. Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview cs.IT · 2005 · author #1
  37. Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity cs.IT · 2005 · author #2
  38. Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity cs.IT · 2005 · author #2
  39. On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing cs.IT · 2005 · author #1
  40. On the Parity-Check Density and Achievable Rates of LDPC Codes cs.IT · 2005 · author #2
  41. Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes cs.IT · 2005 · author #2

Mentions

  • 1510.02947 #2 · backfill · confidence 0.70 Igal Sason
  • 1508.00335 #1 · backfill · confidence 0.70 Igal Sason
  • 1503.07118 #1 · backfill · confidence 0.70 Igal Sason
  • 1503.03417 #1 · backfill · confidence 0.70 Igal Sason
  • 1502.06428 #1 · backfill · confidence 0.70 Igal Sason
  • 1501.03616 #1 · backfill · confidence 0.70 Igal Sason
  • 1403.7164 #1 · backfill · confidence 0.70 Igal Sason
  • 1401.6060 #3 · backfill · confidence 0.70 Igal Sason
  • 1306.4934 #1 · backfill · confidence 0.70 Igal Sason
  • 1301.7504 #1 · backfill · confidence 0.70 Igal Sason
  • 1212.4663 #2 · backfill · confidence 0.70 Igal Sason
  • 1209.5259 #1 · backfill · confidence 0.70 Igal Sason
  • 1207.0436 #1 · backfill · confidence 0.70 Igal Sason
  • 1206.6811 #1 · backfill · confidence 0.70 Igal Sason
  • 1201.0533 #1 · backfill · confidence 0.70 Igal Sason
  • 1111.1995 #1 · backfill · confidence 0.70 Igal Sason
  • 1111.1992 #1 · backfill · confidence 0.70 Igal Sason
  • 1111.1982 #1 · backfill · confidence 0.70 Igal Sason
  • 1111.1977 #1 · backfill · confidence 0.70 Igal Sason
  • 1005.2770 #2 · backfill · confidence 0.70 Igal Sason
  • 0711.1056 #1 · backfill · confidence 0.70 Igal Sason
  • 0709.0599 #1 · backfill · confidence 0.70 Igal Sason

Frequent Coauthors