Superselectors: Efficient Constructions and Applications

Details Superselectors: Efficient Constructions and Applications Superselectors: Efficient Constructions and Applications

2010-10-05

arxiv.org/abs/1010.1024v1

Computer Science

Data Structures and Algorithms

Scientific paper

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel conflict resolution and data security. We prove close upper and lower bounds on the size of superselectors and we provide efficient algorithms for their constructions. Albeit our bounds are very general, when they are instantiated on the combinatorial structures that are particular cases of superselectors (e.g., (p,k,n)-selectors, (d,\ell)-list-disjunct matrices, MUT_k(r)-families, FUT(k, a)-families, etc.) they match the best known bounds in terms of size of the structures (the relevant parameter in the applications). For appropriate values of parameters, our results also provide the first efficient deterministic algorithms for the construction of such structures.

Affiliated with

Also associated with

No associations

Rating

Superselectors: Efficient Constructions and Applications 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 Superselectors: Efficient Constructions and Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superselectors: Efficient Constructions and Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-426923