A robust parallel algorithm for combinatorial compressed sensing
It was shown in [1] that a vector x ∈ R n with at most k < n nonzeros can be recovered from an expander sketch Ax in O(nnz(A) log k) operations via the Parallel-`0 decoding algorithm, where nnz(A) denotes the number of nonzero entries in A ∈ R m×n . In this paper we present the Robust-`0 deco...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
IEEE
2018
|