- Associate 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 an associate 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.
Fan, Z, and Pfister, HD. "List-message passing achieves capacity on the q-ary symmetric channel for large q." December 1, 2007. Full Text
Soriaga, JB, Pfister, HD, and Siegel, PH. "Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding." April 2007. Full Text
Zhang, F, and Pfister, HD. "List-Message Passing Achieves Capacity on the q-ary Symmetric Channel for Large q." IEEE, 2007. Full Text
Hou, J, Smee, JE, Soriaga, JB, Chen, J, and Pfister, HD. "Link-level modeling and performance of CDMA interference cancellation." December 1, 2006. Full Text
Sason, I, and Pfister, HD. "Recent results on capacity-achieving codes for the erasure channel with bounded complexity." December 1, 2006. Full Text
Sason, I, Pfister, HD, and IEEE, . "Recent results on capacity-achieving codes for the erasure channel with bounded complexity." 2006.
Pfister, HD. "Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel." December 1, 2005. Full Text
Pfister, H, Sason, I, and Urbanke, R. "Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity." July 2005. Full Text
Pfister, HD, and Sason, I. "Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity." January 1, 2005.