| Capacity achieving LDPC codes through puncturing CH Hsu, A Anastasopoulos IEEE Transactions on Information Theory 54 (10), 4698-4706, 2008 | 96 | 2008 |
| Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding CH Hsu, A Anastasopoulos IEEE transactions on information theory 56 (3), 992-1006, 2010 | 36 | 2010 |
| Capacity-achieving codes with bounded graphical complexity on noisy channels CH Hsu, A Anastasopoulos arXiv preprint cs/0509062, 2005 | 31 | 2005 |
| Design and analysis of capacity-achieving codes and optimal receivers with low complexity CH Hsu University of Michigan., 2006 | 17 | 2006 |
| Asymptotic weight distributions of irregular repeat-accumulate codes CH Hsu, A Anastasopoulos GLOBECOM'05. IEEE Global Telecommunications Conference, 2005. 3, 5 pp., 2005 | 16 | 2005 |
| Capacity-achieving codes for noisy channels with bounded graphical complexity and maximum likelihood decoding CH Hsu, A Anastasopoulos IEEE Trans. Information Theory, 2006 | 10 | 2006 |
| Design and analysis of joint data detection and frequency/phase estimation algorithms CH Hsu, A Anastasopoulos IEEE Journal on Selected Areas in Communications 23 (9), 1707-1717, 2005 | 7 | 2005 |
| Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem CH Hsu, A Anastasopoulos International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 147, 2004 | 3 | 2004 |
| Iterative decoding performance bounds for LDPC codes on noisy channels CH Hsu, A Anastasopoulos arXiv preprint cs/0607020, 2006 | 1 | 2006 |
| Subexponential-complexity exact sequence detection in the presence of frequency and phase uncertainty CH Hsu, A Anastasopoulos 2004 IEEE International Conference on Communications (IEEE Cat. No …, 2004 | 1 | 2004 |
| Joint Data Detection and Frequency/Phase Estimation at Low Signal-to-Noise Ratio CH Hsu, A Anastasopoulos | | |
