Igal Sason

Citat de

	Toate	Din 2020
Referințe bibliografice	3712	1074
h-index	32	17
i10-index	59	26

220

110

165

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202515 33 49 38 39 87 98 178 122 191 176 145 153 123 164 145 181 150 160 166 199 198 197 205 212 207 53

Acces public

Afișați-le pe toate

6 articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Shlomo Shamai (Shitz)Distinguished Professor, Technion - Israel Institute of TechnologyAdresă de e-mail confirmată pe ee.technion.ac.il
Ruediger UrbankeEPFLAdresă de e-mail confirmată pe epfl.ch
Sergio Verduinformationtheory.orgAdresă de e-mail confirmată pe informationtheory.org
Henry PfisterProfessor of Electrical and Computer Engineering, Duke UniversityAdresă de e-mail confirmată pe duke.edu
Maxim RaginskyProfessor of Electrical and Computer Engineering, University of Illinois, Urbana-ChampaignAdresă de e-mail confirmată pe illinois.edu
Michael PelegTechnionAdresă de e-mail confirmată pe technion.ac.il
Neri MerhavProfessor of Electrical Engineering, Technion, Israel.Adresă de e-mail confirmată pe ee.technion.ac.il
Emre TelatarEPFLAdresă de e-mail confirmată pe epfl.ch
Marco MondelliProfessor, IST AustriaAdresă de e-mail confirmată pe ist.ac.at
Hamed HassaniUniversity of Pennsylvania (EE, CS, Stat)Adresă de e-mail confirmată pe seas.upenn.edu
Dariush DivsalarSenior Research Scientist JPL CaltechAdresă de e-mail confirmată pe jpl.nasa.gov
Chao TianElectrical and Computer Engineering Department, Texas A&M UniversityAdresă de e-mail confirmată pe tamu.edu
Eshed RamPh.D, Nvidia, IsraelAdresă de e-mail confirmată pe technion.ac.il
Tomohiro NishiyamaIndependent researcherAdresă de e-mail confirmată pe kcf.biglobe.ne.jp
M. Ashok KumarIndian Institute of Technology PalakkadAdresă de e-mail confirmată pe iitpkd.ac.in
N. KalouptsidisProfessor of Informatics and Communications, National Kapodistrian University of AthensAdresă de e-mail confirmată pe di.uoa.gr
Kostis XenoulisAdresă de e-mail confirmată pe di.uoa.gr
Robert Graczyk

Urmăriți

Igal Sason

Professor of Electrical and Computer Engineering, Technion, Haifa, Israel

Adresă de e-mail confirmată pe technion.ac.il - Pagina de pornire

Information Theory Coding Theory Extremal Graph Theory Spectral Graph Theory


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
On achievable rate regions for the Gaussian interference channel I Sason IEEE Transactions on Information Theory 50 (6), 1345-1356, 2004	357	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	296	2013
f-divergence Inequalities I Sason, S Verdú IEEE Transactions on Information Theory 62 (11), 5973-6006, 2016	207	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	183	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	170	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	131	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	99	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	83	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	74	2007
On f-divergences: integral representations, local behavior, and inequalities I Sason Entropy 20 (5), 383, 2018	72	2018
Entropy bounds for discrete random variables via maximal coupling I Sason IEEE Transactions on Information Theory 59 (11), 7118-7131, 2013	67	2013
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
On interleaved, differentially encoded convolutional codes M Peleg, I Sason, S Shamai, A Elia IEEE Transactions on Information Theory 45 (7), 2572-2582, 1999	67	1999
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 Rényi entropy power inequalities E Ram, I Sason IEEE Transactions on Information Theory 62 (12), 6800-6815, 2016	49	2016
Performance bounds for erasure, list, and decision feedback schemes with linear block codes E Hof, I Sason, S Shamai IEEE Transactions on Information Theory 56 (8), 3754-3778, 2010	48	2010
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	48	2004

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori