| Design of capacity-approaching irregular low-density parity-check codes TJ Richardson, MA Shokrollahi, RL Urbanke IEEE transactions on information theory 47 (2), 619-637, 2001 | 3970 | 2001 |
| Raptor codes A Shokrollahi IEEE/ACM Transactions on Networking (TON) 14 (SI), 2551-2567, 2006 | 3367* | 2006 |
| Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001 | 1244 | 2001 |
| Improved low-density parity-check codes using irregular graphs MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on information Theory 47 (2), 585-598, 2001 | 1122 | 2001 |
| Practical loss-resilient codes M Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman, V Stemann STOC 97, 150-159, 1997 | 1069 | 1997 |
| Algebraic complexity theory P Bürgisser, M Clausen, MA Shokrollahi Springer Science & Business Media, 2013 | 991 | 2013 |
| Analysis of low density codes and improved designs using irregular graphs. M Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman, V Stemann STOC 98, 249-258, 1998 | 433 | 1998 |
| Raptor codes on binary memoryless symmetric channels O Etesami, A Shokrollahi IEEE Transactions on Information Theory 52 (5), 2033-2051, 2006 | 422 | 2006 |
| Analysis of Random Processes via And-Or Tree Evaluation. M Luby, M Mitzenmacher, MA Shokrollahi SODA 98, 364-373, 1998 | 410 | 1998 |
| Representation theory for high-rate multiple-antenna code design A Shokrollahi, B Hassibi, BM Hochwald, W Sweldens IEEE Transactions on Information theory 47 (6), 2335-2367, 2001 | 398 | 2001 |
| Raptor forward error correction scheme for object delivery A Shokrollahi, M Luby, M Watson, T Stockhammer | 332 | 2007 |
| Efficient decoding of Reed-Solomon codes beyond half the minimum distance RM Roth, G Ruckenstein IEEE Transactions on Information Theory 46 (1), 246-257, 2000 | 305 | 2000 |
| Capacity-achieving sequences for the erasure channel P Oswald, A Shokrollahi IEEE Transactions on Information Theory 48 (12), 3017-3028, 2002 | 244 | 2002 |
| Completeness and reduction in algebraic complexity theory P Bürgisser Springer Science & Business Media, 2013 | 219* | 2013 |
| New sequences of linear time erasure codes approaching the channel capacity MA Shokrollahi International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 1999 | 203 | 1999 |
| LDPC codes: An introduction A Shokrollahi Digital Fountain, Inc., Tech. Rep 2, 17, 2003 | 191 | 2003 |
| Evolving artificial neural network and imperialist competitive algorithm for prediction oil flow rate of the reservoir MA Ahmadi, M Ebadi, A Shokrollahi, SMJ Majidi Applied Soft Computing 13 (2), 1085-1098, 2013 | 185 | 2013 |
| Power and pin efficient chip-to-chip communications with common-mode rejection and SSO resilience H Cronie, A Shokrollahi US Patent 8,539,318, 2013 | 168 | 2013 |
| Orthogonal differential vector signaling H Cronie, A Shokrollahi US Patent 9,288,089, 2016 | 151 | 2016 |
| Methods and systems for noise resilient, pin-efficient and low power communications with sparse signaling codes H Cronie, A Shokrollahi, A Tajalli US Patent 8,649,445, 2014 | 150 | 2014 |
Michael LubyInternational Computer Science InstituteDirección de correo verificada de icsi.berkeley.edu
