194 citations · 766 across the 24 of their papers we have counts for
5 papers · 2 filters
Guessing Facets: Polytope Structure and Improved LP Decoder
Alexandros G. Dimakis, Martin J. Wainwright
A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investiga…
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds
Emin Martinian, Martin J. Wainwright
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder…
Geographic Gossip: Efficient Aggregation for Sensor Networks
Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain env…
Analysis of LDGM and compound codes for lossy compression and binning
Emin Martinian, Martin J. Wainwright
Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on the effecti…
Low density codes achieve the rate-distortion bound
Emin Martinian, Martin J. Wainwright
We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a set of an…