# 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.

Zhang, F., and H. D. Pfister. “Verification decoding of high-rate ldpc codes with applications in compressed sensing.” *Ieee Transactions on Information Theory*, vol. 58, no. 8, July 2012, pp. 5042–58. *Scopus*, doi:10.1109/TIT.2012.2201344.
Full Text

Kim, B. H., and H. D. Pfister. “Joint decoding of LDPC codes and finite-state channels via linear-programming.” *Ieee Journal on Selected Topics in Signal Processing*, vol. 5, no. 8, Dec. 2011, pp. 1563–76. *Scopus*, doi:10.1109/JSTSP.2011.2165525.
Full Text

Zhang, F., and H. D. Pfister. “Analysis of verification-based decoding on the q-ary symmetric channel for large q.” *Ieee Transactions on Information Theory*, vol. 57, no. 10, Oct. 2011, pp. 6754–70. *Scopus*, doi:10.1109/TIT.2011.2165813.
Full Text

Nguyen, P. S., et al. “On multiple decoding attempts for Reed - Solomon codes: A rate-distortion approach.” *Ieee Transactions on Information Theory*, vol. 57, no. 2, Feb. 2011, pp. 668–91. *Scopus*, doi:10.1109/TIT.2010.2095202.
Full Text

Wilson, M. P., et al. “Joint physical layer coding and network coding for bidirectional relaying.” *Ieee Transactions on Information Theory*, vol. 56, no. 11, Nov. 2010, pp. 5641–54. *Scopus*, doi:10.1109/TIT.2010.2068750.
Full Text

Zhang, F., et al. “Girth-10 LDPC codes based on 3-D cyclic lattices.” *Ieee Transactions on Vehicular Technology*, vol. 57, no. 2, Mar. 2008, pp. 1049–60. *Scopus*, doi:10.1109/TVT.2007.905622.
Full Text

Pfister, H. D., and I. Sason. “Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity.” *Ieee Transactions on Information Theory*, vol. 53, no. 6, June 2007, pp. 2088–115. *Scopus*, doi:10.1109/TIT.2007.896873.
Full Text

Hou, J., et al. “Implementing interference cancellation to increase the EV-DO Rev A reverse link capacity.” *Ieee Communications Magazine*, vol. 44, no. 2, Feb. 2006, pp. 96–102. *Scopus*, doi:10.1109/MCOM.2006.1593551.
Full Text

Pfister, Henry D., et al. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” *Ieee Trans. Inf. Theory*, vol. 51, 2005, pp. 2352–79.

Soriaga, Joseph B., et al. “On the low-rate Shannon limit for binary intersymbol interference channels.” *Ieee Trans. Communications*, vol. 51, 2003, pp. 1962–64.

## Pages

Jian, Yung-Yih, et al. “Approaching capacity at high rates with iterative hard-decision decoding.” *Isit*, IEEE, 2012, pp. 2696–700.

Hamidi-Sepehr, Fatemeh, et al. “On the performance of random block codes over finite-state fading channels.” *Allerton Conference*, IEEE, 2012, pp. 17–25.

Yedla, Arvind, et al. “A simple proof of threshold saturation for coupled vector recursions.” *Itw*, IEEE, 2012, pp. 25–29.

Yedla, A., et al. “Universal codes for the Gaussian MAC via spatial coupling.” *2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011*, 2011, pp. 1801–08. *Scopus*, doi:10.1109/Allerton.2011.6120387.
Full Text

Kumar, S., et al. “Large deviations on empirical service for erasure channels with memory.” *2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011*, 2011, pp. 1641–48. *Scopus*, doi:10.1109/Allerton.2011.6120365.
Full Text

Yedla, A., et al. “Universality for the noisy Slepian-Wolf problem via spatial coupling.” *Ieee International Symposium on Information Theory Proceedings*, 2011, pp. 2567–71. *Scopus*, doi:10.1109/ISIT.2011.6034032.
Full Text

Hamidi-Sepehr, F., et al. “Queueing behavior of the Gilbert-Elliott channel: BCH codes and Poisson arrivals.” *Ieee International Symposium on Information Theory Proceedings*, 2011, pp. 1806–10. *Scopus*, doi:10.1109/ISIT.2011.6033861.
Full Text

Kim, B. H., and H. D. Pfister. “An iterative joint linear-programming decoding of LDPC codes and finite-state channels.” *Ieee International Conference on Communications*, 2011. *Scopus*, doi:10.1109/icc.2011.5962814.
Full Text

Yedla, Arvind, et al. “Universality for the noisy Slepian-Wolf problem via spatial coupling.” *Isit*, edited by Alexander Kuleshov et al., IEEE, 2011, pp. 2567–71.

Yedla, Arvind, et al. “Universal codes for the Gaussian MAC via spatial coupling.” *Allerton*, IEEE, 2011, pp. 1801–08.