| 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 | 4651 | 2001 |
| The capacity of low-density parity-check codes under message-passing decoding TJ Richardson, RL Urbanke IEEE Transactions on information theory 47 (2), 599-618, 2001 | 4182 | 2001 |
| Modern Coding Theory, 2008 T Richardson, R Urbanke Cambridge Univ. Press, 0 | 2799* | |
| On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit SY Chung, GD Forney, TJ Richardson, R Urbanke IEEE Communications letters 5 (2), 58-60, 2001 | 2415 | 2001 |
| Efficient encoding of low density parity check codes TJ Richarson, RL Urbanke IEEE Trans. Inf. Theory 47 (2), 638-656, 2001 | 1725 | 2001 |
| Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation SY Chung, TJ Richardson, RL Urbanke IEEE Transactions on Information theory 47 (2), 657-670, 2001 | 1641 | 2001 |
| Finite-length analysis of low-density parity-check codes on the binary erasure channel C Di, D Proietti, IE Telatar, TJ Richardson, RL Urbanke IEEE Transactions on Information theory 48 (6), 1570-1579, 2002 | 1096 | 2002 |
| Systematic design of unitary space-time constellations BM Hochwald, TL Marzetta, TJ Richardson, W Sweldens, R Urbanke IEEE transactions on Information Theory 46 (6), 1962-1973, 2000 | 942 | 2000 |
| Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC S Kudekar, TJ Richardson, RL Urbanke IEEE Transactions on Information Theory 57 (2), 803-834, 2011 | 785 | 2011 |
| A rate-splitting approach to the Gaussian multiple-access channel B Rimoldi, R Urbanke Information Theory, IEEE Transactions on 42 (2), 364-375, 1996 | 505 | 1996 |
| Spatially coupled ensembles universally achieve capacity under belief propagation S Kudekar, T Richardson, RL Urbanke IEEE Transactions on Information Theory 59 (12), 7761-7813, 2013 | 502 | 2013 |
| Polar codes: Characterization of exponent, bounds, and constructions SB Korada, E Şaşoğlu, R Urbanke IEEE Transactions on Information Theory 56 (12), 6253-6264, 2010 | 449 | 2010 |
| Performance of polar codes for channel and source coding N Hussami, R Urbanke, SB Korada Information Theory, 2009. ISIT 2009. IEEE International Symposium on, 1488-1492, 2009 | 399 | 2009 |
| Multi-edge type LDPC codes T Richardson, R Urbanke Workshop honoring Prof. Bob McEliece on his 60th birthday, California …, 2002 | 396 | 2002 |
| Polar codes are optimal for lossy source coding SB Korada, RL Urbanke IEEE Transactions on Information Theory 56 (4), 1751-1768, 2010 | 353 | 2010 |
| The renaissance of Gallager's low-density parity-check codes T Richardson, R Urbanke IEEE Communications Magazine 41 (8), 126-131, 2003 | 267 | 2003 |
| Reed-Muller codes achieve capacity on erasure channels S Kudekar, S Kumar, M Mondelli, HD Pfister, E Şaşoğlu, R Urbanke Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 203 | 2016 |
| Multiple-antenna signal constellations for fading channels D Agrawal, TJ Richardson, RL Urbanke IEEE Transactions on Information Theory 47 (6), 2618-2626, 2001 | 186 | 2001 |
| 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 |
| Weight distribution of low-density parity-check codes C Di, TJ Richardson, RL Urbanke IEEE Transactions on Information Theory 52 (11), 4839-4855, 2006 | 167 | 2006 |
Hamed HassaniUniversity of Pennsylvania (EE, CS, Stat)在 seas.upenn.edu 的電子郵件地址已通過驗證
