Abstract:
We construct codes that allow to exactly recover the support of an unknown sparse
vector with almost equal absolute values of all nonzero coordinates given results of linear measurements in the presence of noise with $\ell_p$-norm bounded from above. We propose a decoding
algorithm with asymptotically minimum complexity.
Keywords:compressed sensing, sparse vector support, group testing, false coin problem, signature codes for a noisy multiple-access adder channel, multimedia digital fingerprinting codes.