164 citations · 1.2k across the 72 of their papers we have counts for
6 papers · 2 filters
The Replica-Symmetric Prediction for Compressed Sensing with Gaussian Matrices is Exact
Galen Reeves, Henry D. Pfister
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 chara…
Near-Optimal Finite-Length Scaling for Polar Codes over Large Alphabets
Henry D. Pfister, Rüdiger Urbanke
For any prime power , Mori and Tanaka introduced a family of -ary polar codes based on ~by~ Reed-Solomon polarization kernels. For transmission over a -ary erasure c…
A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels
Oron Sabag, Haim H. Permuter, Henry D. Pfister
An upper bound on the feedback capacity of unifilar finite-state channels (FSCs) is derived. A new technique, called the -contexts, is based on a construction of a directed grap…
Density Evolution for Deterministic Generalized Product Codes with Higher-Order Modulation
Christian Häger, Alexandre Graell i Amat, Henry D. Pfister +1
Generalized product codes (GPCs) are extensions of product codes (PCs) where coded bits are protected by two component codes but not necessarily arranged in a rectangular array. It…
Reed-Muller Codes Achieve Capacity on Erasure Channels
Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli +3
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relyin…
Comparing the Bit-MAP and Block-MAP Decoding Thresholds of Reed-Muller Codes on BMS Channels
Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli +2
The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure ch…