Henry Pfister

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.

Education & Training
  • Ph.D., University of California, San Diego 2003

Rengaswamy, N, Calderbank, R, Pfister, HD, and Kadhe, S. "Synthesis of Logical Clifford Operators via Symplectic Geometry." Ieee International Symposium on Information Theory Proceedings 2018-June (August 15, 2018): 791-795. Full Text

Hager, C., and H. D. Pfister. “Deep Learning of the Nonlinear Schrödinger Equation in Fiber-Optic Communications.” Ieee International Symposium on Information Theory  Proceedings, vol. 2018-June, Aug. 2018, pp. 1590–94. Scopus, doi:10.1109/ISIT.2018.8437734. Full Text

Santi, E., et al. “Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks.” Ieee International Symposium on Information Theory  Proceedings, vol. 2018-June, Aug. 2018, pp. 1296–300. Scopus, doi:10.1109/ISIT.2018.8437637. Full Text

Hager, C., and H. D. Pfister. “Approaching Miscorrection-Free Performance of Product Codes with Anchor Decoding.” Ieee Transactions on Communications, vol. 66, no. 7, July 2018, pp. 2797–808. Scopus, doi:10.1109/TCOMM.2018.2816073. Full Text

Häger, C., and H. D. Pfister. “Nonlinear interference mitigation via deep neural networks.” Optics Infobase Conference Papers, vol. Part F84-OFC 2018, Jan. 2018. Scopus, doi:10.1364/OFC.2018.W3A.4. Full Text

Luo, Yi, and Henry Pfister. “Adversarial Defense of Image Classification Using a Variational Auto-Encoder.Corr, vol. abs/1812.02891, 2018.

Häger, C., and H. D. Pfister. “Miscorrection-free Decoding of Staircase Codes.” European Conference on Optical Communication, Ecoc, vol. 2017-September, Sept. 2017, pp. 1–3. Scopus, doi:10.1109/ECOC.2017.8345919. Full Text

Charbonneau, Patrick, et al. “Cycle-expansion method for the Lyapunov exponent, susceptibility, and higher moments.Physical Review. E, vol. 96, no. 3–1, Sept. 2017, p. 032129. Epmc, doi:10.1103/physreve.96.032129. Full Text Open Access Copy

Jian, Y. Y., et al. “Approaching Capacity at High Rates with Iterative Hard-Decision Decoding.” Ieee Transactions on Information Theory, vol. 63, no. 9, Sept. 2017, pp. 5752–73. Scopus, doi:10.1109/TIT.2017.2717838. Full Text

Kudekar, S., et al. “Reed-muller codes achieve capacity on erasure channels.” Ieee Transactions on Information Theory, vol. 63, no. 7, July 2017, pp. 4298–316. Scopus, doi:10.1109/TIT.2017.2673829. Full Text

Pages

Rengaswamy, N., and H. D. Pfister. “Cyclic polar codes.” Ieee International Symposium on Information Theory  Proceedings, vol. 2015-June, 2015, pp. 1287–91. Scopus, doi:10.1109/ISIT.2015.7282663. Full Text

Häger, C., et al. “On parameter optimization for staircase codes.” Optical Fiber Communication Conference, Ofc 2015, 2015.

Hager, C., et al. “On parameter optimization for staircase codes.” Conference on Optical Fiber Communication, Technical Digest Series, vol. 2015-June, 2015.

Vem, A., et al. “Multilevel lattices based on spatially-coupled LDPC codes with applications.” Ieee International Symposium on Information Theory  Proceedings, 2014, pp. 2336–40. Scopus, doi:10.1109/ISIT.2014.6875251. Full Text

Kumar, S., et al. “Spatially-coupled codes for side-information problems.” Ieee International Symposium on Information Theory  Proceedings, 2014, pp. 516–20. Scopus, doi:10.1109/ISIT.2014.6874886. Full Text

Pfister, H. D., and K. R. Narayanan. “An introduction to spatially-coupled codes via practical examples.” 2014 31th Ursi General Assembly and Scientific Symposium, Ursi Gass 2014, 2014. Scopus, doi:10.1109/URSIGASS.2014.6929240. Full Text

Pfister, H. D., and P. O. Vontobel. “On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes.” Ieee International Symposium on Information Theory  Proceedings, 2013, pp. 3000–04. Scopus, doi:10.1109/ISIT.2013.6620776. Full Text

Obata, N., et al. “Spatially-coupled multi-edge type LDPC codes with bounded degrees that achieve capacity on the BEC under BP decoding.” Ieee International Symposium on Information Theory  Proceedings, 2013, pp. 2433–37. Scopus, doi:10.1109/ISIT.2013.6620663. Full Text

Tunali, N. E., et al. “Spatially-coupled low density lattices based on construction a with applications to compute-and-forward.” 2013 Ieee Information Theory Workshop, Itw 2013, 2013. Scopus, doi:10.1109/ITW.2013.6691275. Full Text

Jian, Y. Y., et al. “Iterative hard-decision decoding of braided BCH codes for high-speed optical communication.” Globecom  Ieee Global Telecommunications Conference, 2013, pp. 2376–81. Scopus, doi:10.1109/GLOCOM.2013.6831429. Full Text

Pages