On the Recovery of an Integer Vector from Linear Measurements
- 11 Downloads
Let 1 ≤ 2l ≤ m < d. A vector x ∈ ℤd is said to be l-sparse if it has at most l nonzero coordinates. Let an m × d matrix A be given. The problem of the recovery of an l-sparse vector x ∈ Zd from the vector y = Ax ∈ Rm is considered. In the case m = 2l, we obtain necessary conditions and sufficient conditions on the numbers m, d, and k ensuring the existence of an integer matrix A all of whose elements do not exceed k in absolute value which makes it possible to reconstruct l-sparse vectors in ℤd. For a fixed m, these conditions on d differ only by a logarithmic factor depending on k.
Keywordsnonsingular matrix lattices successive minima
Unable to display preview. Download preview PDF.
- 1.M. Davenport, M. Duarte, Y. C. Eldar, and G. Kutyniok, “Introduction to compressed sensing,” in Compressed Sensing (Cambridge Univ. Press, Cambridge, 2012), pp. 1–64.Google Scholar
- 3.L. Fukshansky, D. Needell, and B. Sudakov, An Algebraic Perspective on Integer Sparse Recovery, arXiv: 1801.01256 (2018).Google Scholar