Scholars@Duke
Henry Pfister

Henry Pfister

Addy Family Professor of Electrical and Computer Engineering
Pierre R. Lamond Department of Electrical and Computer Engineering
90984, 315 Gross Hall, Durham, NC 27708
140 Science Dr., 305 Gross Hall, Durham, NC 27708

Featured Works

Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity

Conference · October 27, 2021 Featured Work This paper considers the performance of Reed-Muller (RM) codes transmitted over binary memoryless symmetric (BMS) channels under bitwise maximum-a-posteriori (bit-MAP) decoding. Its main result is that, for a fixed BMS channel, the family of binary RM code ... Link to item Cite

The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact

Conference IEEE International Symposium on Information Theory Proceedings · August 10, 2016 Featured Work This paper considers the fundamental limit of compressed sensing for i.i.d. signal distributions and i.i.d. Gaussian measurement matrices. Its main contribution is a rigorous characterization of the asymptotic mutual information (MI) and minimum mean-squar ... Full text Cite

Threshold saturation for spatially coupled LDPC and LDGM codes on BMS channels

Journal article IEEE Transactions on Information Theory · December 1, 2014 Featured Work Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now termed threshold sat ... Full text Cite

A simple proof of maxwell saturation for coupled scalar recursions

Journal article IEEE Transactions on Information Theory · January 1, 2014 Featured Work Low-density parity-check (LDPC) convolutional codes (or spatially coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance ... Full text Cite

On the achievable information rates of finite state ISI channels

Conference Conference Record IEEE Global Telecommunications Conference · December 1, 2001 Featured Work In this paper, we present two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels. Both methods require only the ability to simulate the channel with an a posteriori probability (APP) detector matched ... Cite