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

Scholarly Works - Digital publications

Density evolution for deterministic generalized product codes on the binary erasure channel at high rates

Digital publication · July 1, 2017 Generalized product codes (GPCs) are extensions of product codes (PCs), where code symbols are protected by two component codes but not necessarily arranged in a rectangular array. We consider a deterministic construction of GPCs (as opposed to randomized ... Full text Cite

Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels

Digital publication · July 16, 2011 Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the "threshold sa ... Link to item Cite

Message-Passing Inference on a Factor Graph for Collaborative Filtering

Digital publication · April 7, 2010 This paper introduces a novel message-passing (MP) framework for the collaborative filtering (CF) problem associated with recommender systems. We model the movie-rating prediction problem popularized by the Netflix Prize, using a probabilistic factor graph ... Link to item Cite

On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing

Digital publication · March 12, 2009 This paper considers the performance of $(j,k)$-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the bin ... Link to item Cite

Bounds on the decoding complexity of punctured codes on graphs

Digital publication · September 14, 2004 We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. This ... Link to item Cite