most citedNetwork Coding for Distributed Storage Systems

31 citations · 42 across the 5 of their papers we have counts for

collaborators

5 papers

cs.IT2008

Lower Bounds on the Rate-Distortion Function of LDGM Codes

A. G. Dimakis, M. J. Wainwright, K. Ramchandran

A recent line of work has focused on the use of low-density generator matrix (LDGM) codes for lossy source coding. In this paper, wedevelop a generic technique for deriving lower b…

cs.IT2008

Bits through ARQs

Krishnan Eswaran, Michael Gastpar, Kannan Ramchandran

A fundamental problem in dynamic frequency reuse is that the cognitive radio is ignorant of the amount of interference it inflicts on the primary license holder. A model for such a…

math.ST200811 cited

Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices

Wei Wang, Martin J. Wainwright, Kannan Ramchandran

We study the information-theoretic limits of exactly recovering the support of a sparse signal using noisy projections defined by various classes of measurement matrices. Our analy…

cs.NI200831 cited

Network Coding for Distributed Storage Systems

Alexandros G. Dimakis, P. Brighten Godfrey, Yunnan Wu +2

Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer s…

cs.IT2007

Network Coding for Distributed Storage Systems

Alexandros G. Dimakis, P. Brighten Godfrey, Martin J. Wainwright +1

Peer-to-peer distributed storage systems provide reliable access to data through redundancy spread over nodes across the Internet. A key goal is to minimize the amount of bandwidth…