48 citations · 175 across the 26 of their papers we have counts for
31 papers
Lossy Compression via Sparse Regression Codes: Generalized Construction and Finite-length Bounds
Galen Reeves, Ramji Venkataramanan
We study sparse regression codes (SPARCs) for lossy compression under simple greedy encoding rules, including both correlation-based and distance-based methods. We generalize the S…
From Symmetry to Capacity: Nested Codes on Binary Memoryless Symmetric Channels
Henry D. Pfister, Galen Reeves
The past decade has seen notable advances in our understanding of structured error-correcting codes, particularly binary Reed-Muller (RM) codes. While initial breakthroughs were fo…
Information-Theoretic Proofs for Diffusion Sampling
Galen Reeves, Henry D. Pfister
This paper provides an elementary, self-contained analysis of diffusion-based sampling methods for generative modeling. In contrast to existing approaches that rely on continuous-t…
Approximate Message Passing for the Matrix Tensor Product Model
Riccardo Rossetti, Galen Reeves
We propose and analyze an approximate message passing (AMP) algorithm for the matrix tensor product model, which is a generalization of the standard spiked matrix models that allow…
Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes
Galen Reeves, Henry D. Pfister
Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work…
Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity
Galen Reeves, Henry D. Pfister
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. It…