Abstract
We introduce a new combinatorial structure: superselectors. 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 [15], (d,ℓ)-list-disjunct matrices [25], MUT k (r)-families [28], FUT(k, α)-families [2], 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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Binary Matrix
- Combinatorial Structure
- Multiple Access Channel
- Sparse Signal Recovery
- Combinatorial Group Testing
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alon, N., Asodi, V.: Tracing many users with almost no rate penalty. IEEE Trans. on Information Theory 53(1), 437–439 (2007)
Alon, N., Hod, R.: Optimal Monotone Encodings. IEEE Trans. on Information Theory 55(3), 1343–1353 (2009)
Balding, D.J., et al.: A comparative survey of non-adaptive pooling design. In: Speed, T.P., Waterman, M.S. (eds.) Genetic mapping and DNA sequencing, IMA Volumes in Mathematics and its Appl., pp. 133–154. Springer, Heidelberg (1996)
Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proc. of 28th STOC, pp. 30–36 (1996)
Cheng, Y., Du, D.Z.: New Constructions of One- and Two-Stage Pooling Designs. Journal of Computational Biology 15(2), 195–205 (2008)
Cheng, Y., Du, D.Z., Lin, G.: On the upper bounds of the minimum number of rows of disjunct matrices. Optimization Letters 3, 297–302 (2009)
Chlebus, B.S., Kowalski, D.R.: Almost Optimal Explicit Selectors. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 270–280. Springer, Heidelberg (2005)
Cheraghchi, M.: Noise-resilient group testing: Limitations and constructions. In: Proc. of FCT 2009 (2009)
Chrobak, M., Gasieniec, L., Rytter, W.: Fast Broadcasting and Gossiping in Radio Networks. In: FOCS 2000, pp. 575–581 (2000)
Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. of Symp. on Discrete Algorithms (SODA 2001), pp. 709–718 (2001)
Cormode, G., Muthukrishnan, S.: Combinatorial Algorithms for Compressed Sensing. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 280–294. Springer, Heidelberg (2006)
Cover, T.: Enumerative source encoding. IEEE Trans. Inf. Th. 19, 73–77 (1973)
Damaschke, P.: Adaptive versus Nonadaptive Attribute-Efficient Learning. In: STOC 1998, pp. 590–596 (1998)
De Bonis, A., Vaccaro, U.: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theoretical Computer Science 306, 223–243 (2003)
De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal Two-Stage Algorithms for Group Testing Problems. SIAM J. on Comp. 34(5), 1253–1270 (2005)
Du, D.Z., Hwang, F.K.: Pooling Design and Nonadaptive Group Testing. World Scientific, Singapore (2006)
D’yachkov, A.G., Rykov, V.V.: Bounds of the length of disjunct codes. Problems Control Inform. Theory 11, 7–13 (1982)
D’yachkov, A.G., Rykov, V.V., Rashad, A.M.: Superimposed distance codes. Problems Control Inform. Theory 18, 237–250 (1989)
Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. on Comp. 36, 1360–1375 (2007)
Erdös, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel J. of Math. 51, 75–89 (1985)
Ganguly, S.: Data stream algorithms via expander graph. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 52–63. Springer, Heidelberg (2008)
Gilbert, A.C., Iwen, M.A., Strauss, M.J.: Group Testing and Sparse Signal Recovery. In: 42nd Asilomar Conf. on Signals, Systems, and Computers, pp. 1059–1063 (2008)
Grebinsky, V., Kucherov, G.: Optimal Reconstruction of Graphs under the Additive Model. Algorithmica 28(1), 104–124 (2000)
Indyk, P.: Deterministic superimposed coding with application to pattern matching. In: Proc. of 39th FOCS 1997, pp. 127–136 (1997)
Indyk, P., Ngo, H.Q., Rudra, A.: Efficiently Decodable Non-adaptive Group Testing. In: Proc. of 20th SODA, pp. 1126–1142 (2010)
Kautz, W.H., Singleton, R.R.: Nonrandom binary superimposed codes. IEEE Trans. on Inform. Theory 10, 363–377 (1964)
Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 609–623. Springer, Heidelberg (1999)
Laczay, B., Ruszinkó, M.: Multiple User Tracing Codes. In: Proc. of ISIT 2006, pp. 1900–1904 (2006)
Linial, N.: Locality in distributed graph algorithms. SIAM J. on Computing 21, 311–312 (1992); Discrete Mathematics 162, 311-312 (1996)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)
Moran, T., Naor, M., Segev, G.: Deterministic history-independent strategies for storing information on write-once memories. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 303–315. Springer, Heidelberg (2007)
Porat, B., Porat, E.: Exact and Approximate Pattern Matching in the Streaming Model. In: Proc. 50th FOCS, pp. 315–323 (2009)
Porat, E., Rothschild, A.: Explicit non-adaptive combinatorial group testing schemes. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 748–759. Springer, Heidelberg (2008)
Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: k-Mismatch with Don’t Cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 151–162. Springer, Heidelberg (2007)
Ryabko, B.: Fast Enumerative Source Conding. In: Proc. of 1995 IEEE Intern. Symp. on Inf. Th., p. 395 (1995)
Wolf, J.: Born again group testing: Multiaccess Communications. IEEE Trans. Information Theory 31, 185–191 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cicalese, F., Vaccaro, U. (2010). Superselectors: Efficient Constructions and Applications. In: de Berg, M., Meyer, U. (eds) Algorithms – ESA 2010. ESA 2010. Lecture Notes in Computer Science, vol 6346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15775-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-15775-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15774-5
Online ISBN: 978-3-642-15775-2
eBook Packages: Computer ScienceComputer Science (R0)