Igal Sason

Citado por

	Total	Desde 2020
Citas	3698	1053
Índice h	32	17
Índice i10	60	26

220

110

165

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202515 34 47 38 39 87 104 181 122 189 178 146 154 121 163 144 181 152 160 167 197 195 198 207 210 205 37

Acceso público

Ver todo

6 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Shlomo Shamai (Shitz)Distinguished Professor, Technion - Israel Institute of TechnologyDirección de correo verificada de ee.technion.ac.il
Ruediger UrbankeEPFLDirección de correo verificada de epfl.ch
Sergio Verduinformationtheory.orgDirección de correo verificada de informationtheory.org
Henry PfisterProfessor of Electrical and Computer Engineering, Duke UniversityDirección de correo verificada de duke.edu
Maxim RaginskyProfessor of Electrical and Computer Engineering, University of Illinois, Urbana-ChampaignDirección de correo verificada de illinois.edu
Neri MerhavProfessor of Electrical Engineering, Technion, Israel.Dirección de correo verificada de ee.technion.ac.il
Emre TelatarEPFLDirección de correo verificada de epfl.ch
Marco MondelliAssistant Professor, IST AustriaDirección de correo verificada de ist.ac.at
Hamed HassaniUniversity of Pennsylvania (EE, CS, Stat)Dirección de correo verificada de seas.upenn.edu
Dariush DivsalarSenior Research Scientist JPL CaltechDirección de correo verificada de jpl.nasa.gov
Michael PelegTechnionDirección de correo verificada de technion.ac.il
Chao TianElectrical and Computer Engineering Department, Texas A&M UniversityDirección de correo verificada de tamu.edu
Eshed RamPh.D, Nvidia, IsraelDirección de correo verificada de technion.ac.il
Tomohiro NishiyamaIndependent researcherDirección de correo verificada de kcf.biglobe.ne.jp
M. Ashok KumarIndian Institute of Technology PalakkadDirección de correo verificada de iitpkd.ac.in
N. KalouptsidisProfessor of Informatics and Communications, National Kapodistrian University of AthensDirección de correo verificada de di.uoa.gr
Kostis XenoulisDirección de correo verificada de di.uoa.gr
Robert GraczykDigital Communications Group, Télécom Paris (IP Paris)Dirección de correo verificada de telecom-paris.fr

Seguir

Igal Sason

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

Dirección de correo verificada de technion.ac.il - Página principal

Information Theory Coding Theory Extremal Graph Theory Spectral Graph Theory


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
On achievable rate regions for the Gaussian interference channel I Sason IEEE Transactions on Information Theory 50 (6), 1345-1356, 2004	356	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	291	2013
f-divergence Inequalities I Sason, S Verdú IEEE Transactions on Information Theory 62 (11), 5973-6006, 2016	200	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	169	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	152	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	135	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
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	66	2013
On interleaved, differentially encoded convolutional codes M Peleg, I Sason, S Shamai, A Elia IEEE Transactions on Information Theory 45 (7), 2572-2582, 1999	66	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	59	2018
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	53	2010
On Rényi entropy power inequalities E Ram, I Sason IEEE Transactions on Information Theory 62 (12), 6800-6815, 2016	52	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	49	2004

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores