Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

DOI10.1109/TIT.2011.2178017zbMath1365.94190arXiv1104.4302OpenAlexW1657130172MaRDI QIDQ5271992

Vincent Y. F. Tan, Stark C. Draper, Laura Balzano

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.4302

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Vector spaces, linear dependence, rank, lineability (15A03) Coding theorems (Shannon theory) (94A24)

Related Items (4)

Almost everywhere injectivity conditions for the matrix recovery problem ⋮ The minimal measurement number for low-rank matrix recovery ⋮ Uniqueness conditions for low-rank matrix recovery ⋮ On the equivalence between low-rank matrix completion and tensor rank

This page was built for publication: Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations