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

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

Hamidi-Sepehr, F., et al. “Delay-Sensitive Communication over Fading Channels: Queueing Behavior and Code Parameter Selection.” Ieee Transactions on Vehicular Technology, vol. 64, no. 9, Sept. 2015, pp. 3957–70. Scopus, doi:10.1109/TVT.2014.2365181. Full Text

Kumar, S., et al. “Threshold saturation for spatially coupled LDPC and LDGM codes on BMS channels.” Ieee Transactions on Information Theory, vol. 60, no. 12, Dec. 2014, pp. 7389–415. Scopus, doi:10.1109/TIT.2014.2360692. Full Text

Jian, Y. Y., and H. D. Pfister. “Convergence of weighted min-sum decoding via dynamic programming on trees.” Ieee Transactions on Information Theory, vol. 60, no. 2, Jan. 2014, pp. 943–63. Scopus, doi:10.1109/TIT.2013.2290303. Full Text

Yedla, A., et al. “A simple proof of maxwell saturation for coupled scalar recursions.” Ieee Transactions on Information Theory, vol. 60, no. 11, Jan. 2014, pp. 6943–65. Scopus, doi:10.1109/TIT.2014.2352296. Full Text

Kumar, S., et al. “First-passage time and large-deviation analysis for erasure channels with memory.” Ieee Transactions on Information Theory, vol. 59, no. 9, Aug. 2013, pp. 5547–65. Scopus, doi:10.1109/TIT.2013.2260593. Full Text

Yedla, A., et al. “Code design for the noisy Slepian-Wolf problem.” Ieee Transactions on Communications, vol. 61, no. 6, June 2013, pp. 2535–45. Scopus, doi:10.1109/TCOMM.2013.032713.120002A. Full Text

Parag, P., et al. “Code-rate selection, queueing behavior, and the correlated erasure channel.” Ieee Transactions on Information Theory, vol. 59, no. 1, Jan. 2013, pp. 397–407. Scopus, doi:10.1109/TIT.2012.2216501. 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.

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

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