| On achievable rate regions for the Gaussian interference channel I Sason IEEE Transactions on Information Theory 50 (6), 1345-1356, 2004 | 350 | 2004 |
| Concentration of measure inequalities in information theory, communications, and coding M Raginsky, I Sason Foundations and Trends® in Communications and Information Theory 10 (1-2), 1-246, 2013 | 269 | 2013 |
| f-divergence Inequalities I Sason, S Verdú IEEE Transactions on Information Theory 62 (11), 5973-6006, 2016 | 176 | 2016 |
| Performance analysis of linear codes under maximum-likelihood decoding: a tutorial I Sason, S Shamai Foundations and Trends® in Communications and Information Theory 3 (1–2), 1-222, 2006 | 174 | 2006 |
| Capacity-achieving ensembles for the binary erasure channel with bounded complexity HD Pfister, I Sason, R Urbanke IEEE Transactions on Information theory 51 (7), 2352-2379, 2005 | 168 | 2005 |
| Variations on the Gallager bounds, connections, and applications S Shamai, I Sason IEEE Transactions on Information Theory 48 (12), 3029-3051, 2002 | 168 | 2002 |
| Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum I Sason, S Shamai IEEE Transactions on Information Theory 46 (1), 24-47, 2000 | 151 | 2000 |
| Parity-check density versus performance of binary linear block codes over memoryless symmetric channels I Sason, R Urbanke IEEE Transactions on Information Theory 49 (7), 1611-1635, 2003 | 134 | 2003 |
| Achieving Marton’s region for broadcast channels using polar codes M Mondelli, SH Hassani, I Sason, RL Urbanke IEEE Transactions on Information Theory 61 (2), 783-800, 2014 | 97 | 2014 |
| An improved sphere-packing bound for finite-length codes over symmetric memoryless channels G Wiechman, I Sason IEEE Transactions on Information Theory 54 (5), 1962-1990, 2008 | 92 | 2008 |
| Arimoto–Rényi conditional entropy and Bayesian M-ary hypothesis testing I Sason, S Verdú IEEE Transactions on Information theory 64 (1), 4-25, 2017 | 74 | 2017 |
| Accumulate–repeat–accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity HD Pfister, I Sason IEEE transactions on information theory 53 (6), 2088-2115, 2007 | 73 | 2007 |
| On interleaved, differentially encoded convolutional codes M Peleg, I Sason, S Shamai, A Elia IEEE Transactions on Information Theory 45 (7), 2572-2582, 1999 | 68 | 1999 |
| On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes I Sason, S Shamai IEEE Transactions on Information Theory 47 (6), 2275-2299, 2001 | 67 | 2001 |
| Entropy bounds for discrete random variables via maximal coupling I Sason IEEE Transactions on Information Theory 59 (11), 7118-7131, 2013 | 61 | 2013 |
| Improved bounds on lossless source coding and guessing moments via Rényi measures I Sason, S Verdú IEEE Transactions on Information Theory 64 (6), 4323-4346, 2018 | 58 | 2018 |
| On f-divergences: integral representations, local behavior, and inequalities I Sason Entropy 20 (5), 383, 2018 | 56 | 2018 |
| On Rényi entropy power inequalities E Ram, I Sason IEEE Transactions on Information Theory 62 (12), 6800-6815, 2016 | 51 | 2016 |
| Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel I Sason, R Urbanke IEEE Transactions on Information Theory 50 (6), 1247-1256, 2004 | 50 | 2004 |
| On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders I Sason, E Telatar, R Urbanke IEEE Transactions on Information Theory 48 (12), 3052-3061, 2002 | 48 | 2002 |
Shlomo Shamai (Shitz)Distinguished Professor, Technion - Israel Institute of TechnologyVerified email at ee.technion.ac.il
