Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by ran

In [12] the authors proved an asymptotic sampling theorem for sparse signals, showing that n random measurements permit to reconstruct an N-vector having k nonzeros provided n > 2

• Type: Journal
• Year: 2010
• Where: TIT
• Authors: David L. Donoho, Jared Tanner
• Keywords: Compressed Sensing, Education, Finite-N Bounds, Real Error-correcting Codes, TIT 2010