Recovery of Short, Complex Linear Combinations Via ℓ Minimization.

This note provides a condition under which ℓ1 minimization (also known as basis pursuit) can recover short linear combinations of complex vectors chosen from fixed, over complete collection. This condition has already been established in the real setting by Fuchs, who used convex analysis. The proof given here is more direct. [ABSTRACT FROM AUTHOR]