Simple algorithms and guarantees for low rank matrix completion over F2

Abstract

Let X be a n1 × n2 matrix with entries in F2 and rank r < min(n1, n2) (often r min(n1, n2)). We consider the problem of reconstructing X given only a subset of its entries. This problem has recently found numerous applications, most notably in network and index coding, where finding optimal linear codes (over some field Fq) can be reduced to finding the… (More)
DOI: 10.1109/ISIT.2016.7541266

Topics

1 Figure or Table

Cite this paper

@inproceedings{Saunderson2016SimpleAA, title={Simple algorithms and guarantees for low rank matrix completion over F2}, author={James Saunderson and Maryam T Fazel and Babak Hassibi}, booktitle={ISIT}, year={2016} }