- 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 a 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).
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 served as an Associate Editor for the IEEE Transactions on Information Theory (2013-2016) and a Distinguished Lecturer of the IEEE Information Theory Society (2015-2016).
His current research interests include information theory, communications, probabilistic graphical models, machine learning, and deep neural networks.
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
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. Information 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.
Can, Trung, et al. Kerdock Codes Determine Unitary 2-Designs.
Häger, Christian, et al. Revisiting Multi-Step Nonlinearity Compensation with Machine Learning.
Yedla, A., et al. “A simple proof of threshold saturation for coupled scalar recursions.” International Symposium on Turbo Codes and Iterative Information Processing, Istc, 2012, pp. 51–55. Scopus, doi:10.1109/ISTC.2012.6325197. Full Text
Narayanan, K. R., and H. D. Pfister. “Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy.” International Symposium on Turbo Codes and Iterative Information Processing, Istc, 2012, pp. 136–39. Scopus, doi:10.1109/ISTC.2012.6325214. Full Text
Yedla, A., et al. “A simple proof of threshold saturation for coupled vector recursions.” 2012 Ieee Information Theory Workshop, Itw 2012, 2012, pp. 25–29. Scopus, doi:10.1109/ITW.2012.6404671. Full Text
Hamidi-Sepehr, F., et al. “On the performance of random block codes over finite-state fading channels.” 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, 2012, pp. 17–25. Scopus, doi:10.1109/Allerton.2012.6483194. Full Text
Nguyen, P. S., et al. “Threshold saturation of spatially-coupled codes on intersymbol-interference channels.” Ieee International Conference on Communications, 2012, pp. 2181–86. Scopus, doi:10.1109/ICC.2012.6364433. Full Text
Kumar, S., et al. “A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels.” 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, 2012, pp. 176–84. Scopus, doi:10.1109/Allerton.2012.6483215. Full Text
Hamidi-Sepehr, F., et al. “On the queueing behavior of Gilbert-Elliott channels in the rare-transition regime.” 2012 46th Annual Conference on Information Sciences and Systems, Ciss 2012, 2012. Scopus, doi:10.1109/CISS.2012.6310913. Full Text
Nguyen, P. S., et al. “On the maximum a posteriori decoding thresholds of multiuser systems with erasures.” Ieee International Symposium on Information Theory Proceedings, 2012, pp. 2701–05. Scopus, doi:10.1109/ISIT.2012.6284013. Full Text
Jian, Y. Y., et al. “Approaching capacity at high rates with iterative hard-decision decoding.” Ieee International Symposium on Information Theory Proceedings, 2012, pp. 2696–700. Scopus, doi:10.1109/ISIT.2012.6284009. Full Text
Xia, Z., et al. “Direction of arrival estimation using canonical and crystallographic volumetric element configurations.” Proceedings of 6th European Conference on Antennas and Propagation, Eucap 2012, 2012, pp. 1436–39. Scopus, doi:10.1109/EuCAP.2012.6206123. Full Text