18 citations · 100 across the 28 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2017
Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate
Arya Mazumdar, Andrew McGregor, Sofya Vorotnikova
Motivated by applications in distributed storage, the storage capacity of a graph was recently defined to be the maximum amount of information that can be stored across the vertice…
cs.IT2007
On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes
Andrew McGregor, Olgica Milenkovic
We prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) code…
cs.IT2004
Distance distribution of binary codes and the error probability of decoding
Alexander Barg, Andrew McGregor
We address the problem of bounding below the probability of error under maximum likelihood decoding of a binary code with a known distance distribution used on a binary symmetric c…