Follow
Igal Sason
Igal Sason
Professor, Technion, Haifa, Israel
Verified email at ee.technion.ac.il - Homepage
Title
Cited by
Cited by
Year
On achievable rate regions for the Gaussian interference channel
I Sason
IEEE Transactions on Information Theory 50 (6), 1345-1356, 2004
3452004
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-250, 2014
2172014
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
1662006
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
1652005
Variations on the Gallager bounds, connections, and applications
S Shamai, I Sason
IEEE Transactions on Information Theory 48 (12), 3029-3051, 2002
1582002
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
1422000
f-divergence inequalities
I Sason, S Verdú
IEEE Transactions on Information Theory 62 (11), 5973-6006, 2016
137*2016
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
1302003
Achieving Marton's region for broadcast channels using polar codes
M Mondelli, SH Hassani, I Sason, R Urbanke
IEEE Transactions on Information Theory 61 (2), 783 - 800, 2015
882015
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), 2275-2299, 2007
88*2007
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
872008
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
662001
Arimoto-Rényi conditional entropy and Bayesian M-ary hypothesis testing
I Sason, S Verdú
IEEE Transactions on Information Theory 64 (1), 4-25, 2018
652018
On interleaved, differentially encoded convolutional codes
M Peleg, I Sason, S Shamai, A Elia
IEEE Transactions on Information Theory 45 (7), 2572-2582, 1999
651999
Entropy bounds for discrete random variables via maximal coupling
I Sason
IEEE Transactions on Information Theory 59 (11), 7118-7131, 2013
59*2013
Capacity-achieving polar codes for arbitrarily-permuted parallel channels
E Hof, I Sason, S Shamai, C Tian
IEEE Transactions on Information Theory 59 (5), 1505 - 1516, 2013
58*2013
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
502004
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
472018
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
472002
Improved upper bounds on the ensemble performance of ML decoded low density parity check codes
I Sason, S Shamai
IEEE Communications Letters 4 (3), 89-91, 2000
462000
The system can't perform the operation now. Try again later.
Articles 1–20