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

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

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

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

Häger, Christian, and Henry D. Pfister. “Approaching Miscorrection-free Performance of Product and Generalized Product Codes..” Corr, vol. abs/1711.07805, 2017.

Hamidi-Sepehr, F., et al. “On the Performance of Block Codes over Finite-State Channels in the Rare-Transition Regime.” Ieee Transactions on Communications, vol. 63, no. 11, Nov. 2015, pp. 3974–90. Scopus, doi:10.1109/TCOMM.2015.2478794. Full Text

Pages

Kudekar, S., et al. “Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels.” Ieee International Symposium on Information Theory  Proceedings, vol. 2016-August, 2016, pp. 1755–59. Scopus, doi:10.1109/ISIT.2016.7541600. Full Text

Sabag, O., et al. “A single-letter upper bound on the feedback capacity of unifilar finite-state channels.” Ieee International Symposium on Information Theory  Proceedings, vol. 2016-August, 2016, pp. 310–14. Scopus, doi:10.1109/ISIT.2016.7541311. Full Text

Pfister, H. D., and R. Urbanke. “Near-optimal finite-length scaling for polar codes over large alphabets.” Ieee International Symposium on Information Theory  Proceedings, vol. 2016-August, 2016, pp. 215–19. Scopus, doi:10.1109/ISIT.2016.7541292. Full Text

Hager, C., et al. “Density evolution and error floor analysis for staircase and braided codes.” 2016 Optical Fiber Communications Conference and Exhibition, Ofc 2016, 2016.

Kudekar, S., et al. “Reed-Muller codes achieve capacity on erasure channels.” Proceedings of the Annual Acm Symposium on Theory of Computing, vol. 19-21-June-2016, 2016, pp. 658–69. Scopus, doi:10.1145/2897518.2897584. Full Text

Kumar, S., et al. “Spatially-coupled codes for write-once memories.” 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, 2016, pp. 125–31. Scopus, doi:10.1109/ALLERTON.2015.7446994. Full Text

Lian, M., and H. D. Pfister. “Belief-propagation reconstruction for compressed sensing: Quantization vs. Gaussian approximation.” 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, 2016, pp. 1106–13. Scopus, doi:10.1109/ALLERTON.2015.7447132. Full Text

Kudekar, Shrinivas, et al. “Reed-Muller codes achieve capacity on erasure channels..” Stoc, edited by Daniel Wichs and Yishay Mansour, ACM, 2016, pp. 658–69.

Pfister, H. D., et al. “Symmetric product codes.” 2015 Information Theory and Applications Workshop, Ita 2015  Conference Proceedings, 2015, pp. 282–90. Scopus, doi:10.1109/ITA.2015.7309002. Full Text

Li, S., et al. “On the limits of treating interference as noise for two-user symmetric Gaussian interference channels.” Ieee International Symposium on Information Theory  Proceedings, vol. 2015-June, 2015, pp. 1711–15. Scopus, doi:10.1109/ISIT.2015.7282748. Full Text

Pages