# Henry Pfister

- Professor in the Department of Electrical and Computer Engineering
- Associate Professor of Mathematics (Secondary)

**External address:**140 Science Dr., 305 Gross Hall, Durham, NC 27708

**Internal office address:**90984, 315 Gross Hall, Durham, NC 27708

**Phone:**(919) 660-5288

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.

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

Pfister, H. D., and P. H. Siegel. “The serial concatenation of rate-1 codes through uniform random interleaves.” *Ieee Transactions on Information Theory*, vol. 49, no. 6, 2003, pp. 1425–38. *Scopus*, doi:10.1109/TIT.2003.811907.
Full Text

Askar, N. K., et al. “Spectral keying/spl trade/: A novel modulation scheme for UWB systems.” *2003 Ieee Conference on Ultra Wideband Systems and Technologies, Uwbst 2003 Conference Proceedings*, 2003, pp. 418–22. *Scopus*, doi:10.1109/UWBST.2003.1267876.
Full Text

Soriaga, Joseph B., et al. *On Approaching the Capacity of Finite-State Intersymbol Interference Channels*. Springer US, 2002, pp. 365–78. *Crossref*, doi:10.1007/978-1-4757-3585-7_21.
Full Text

Hou, J., et al. “Multilevel coding with low-density parity-check component codes.” *Conference Record / Ieee Global Telecommunications Conference*, vol. 2, 2001, pp. 1016–20.

Pfister, H. D., et al. “On the achievable information rates of finite state ISI channels.” *Conference Record / Ieee Global Telecommunications Conference*, vol. 5, 2001, pp. 2992–96.