Coding-Theoretic Methods for Sparse Recovery

Details Coding-Theoretic Methods for Sparse Recovery Coding-Theoretic Methods for Sparse Recovery

2011-10-03

arxiv.org/abs/1110.0279v2

Computer Science

Information Theory

Added Lemma 34 in the first revision. Original version in Proceedings of the Allerton Conference on Communication, Control and

Scientific paper

We review connections between coding-theoretic objects and sparse learning problems. In particular, we show how seemingly different combinatorial objects such as error-correcting codes, combinatorial designs, spherical codes, compressed sensing matrices and group testing designs can be obtained from one another. The reductions enable one to translate upper and lower bounds on the parameters attainable by one object to another. We survey some of the well-known reductions in a unified presentation, and bring some existing gaps to attention. New reductions are also introduced; in particular, we bring up the notion of minimum "L-wise distance" of codes and show that this notion closely captures the combinatorial structure of RIP-2 matrices. Moreover, we show how this weaker variation of the minimum distance is related to combinatorial list-decoding properties of codes.

Affiliated with

Also associated with

No associations

Rating

Coding-Theoretic Methods for Sparse Recovery does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coding-Theoretic Methods for Sparse Recovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding-Theoretic Methods for Sparse Recovery will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270686