- Professor in the Department of Electrical and Computer Engineering
- Associate Professor of Mathematics (Secondary)
Henry D. Pfister received his Ph.D. in Electrical Engineering in 2003 from the University of California, San Diego and is currently a professor in the Electrical and Computer Engineering Department of Duke University with a secondary appointment in Mathematics. Prior to that, he was an associate professor at Texas A&M University (2006-2014), a post-doctoral fellow at the École Polytechnique Fédérale de Lausanne (2005-2006), and a senior engineer at Qualcomm Corporate R&D in San Diego (2003-2004). His current research interests include information theory, error-correcting codes, quantum computing, and machine learning.
He received the NSF Career Award in 2008 and a Texas A&M ECE Department Outstanding Professor Award in 2010. He is a coauthor of the 2007 IEEE COMSOC best paper in Signal Processing and Coding for Data Storage and a coauthor of a 2016 Symposium on the Theory of Computing (STOC) best paper. He has served the IEEE Information Theory Society as a member of the Board of Governors (2019-2022), an Associate Editor for the IEEE Transactions on Information Theory (2013-2016), and a Distinguished Lecturer (2015-2016). He was also the General Chair of the 2016 North American School of Information Theory.
Hou, J., et al. “Link-level modeling and performance of CDMA interference cancellation.” Globecom Ieee Global Telecommunications Conference, 2006. Scopus, doi:10.1109/GLOCOM.2006.661. Full Text
Sason, I., and H. D. Pfister. “Recent results on capacity-achieving codes for the erasure channel with bounded complexity.” Ieee Convention of Electrical and Electronics Engineers in Israel, Proceedings, 2006, pp. 339–43. Scopus, doi:10.1109/EEEI.2006.321096. Full Text
Sason, Igal, and Henry D. Pfister. “Recent results on capacity-achieving codes for the erasure channel with bounded complexity.” 2006 Ieee 24th Convention of Electrical & Electronics Engineers in Israel, IEEE, 2006, pp. 343-+.
Pfister, H. D. “Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel.” Proceedings of the Ieee Itsoc Information Theory Workshop 2005 on Coding and Complexity, Itw2005, 2005, pp. 166–70. Scopus, doi:10.1109/ITW.2005.1531880. Full Text
Pfister, H. D., et al. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” Ieee Transactions on Information Theory, vol. 51, no. 7, 2005, pp. 2352–79. Scopus, doi:10.1109/TIT.2005.850079. Full Text
Pfister, H. D., and I. Sason. “Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity.” 43rd Annual Allerton Conference on Communication, Control and Computing 2005, vol. 1, 2005, pp. 30–44.
Pfister, H., et al. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” Ieee Convention of Electrical and Electronics Engineers in Israel, Proceedings, 2004, pp. 110–13.
Pfister, H., et al. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” Ieee International Symposium on Information Theory Proceedings, 2004.
Soriaga, J. B., et al. “On the low-rate shannon limit for binary intersymbol interference channels.” Ieee Transactions on Communications, vol. 51, no. 12, 2003, pp. 1962–64. Scopus, doi:10.1109/TCOMM.2003.820724. Full Text
Hou, J., et al. “Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes.” Ieee Transactions on Information Theory, vol. 49, no. 9, 2003, pp. 2141-2155+2322. Scopus, doi:10.1109/TIT.2003.815777. Full Text