Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels

Authors:
Annalisa De Bonis;Ugo Vaccaro
Affiliations:
-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 17
Cited 1

Correction to "An asymptotically nonadaptive algorithm for conflict resolution i

IEEE Transactions on Information Theory
Data networks

Data networks
A tale of two coins

American Mathematical Monthly
Locality in distributed graph algorithms

SIAM Journal on Computing
Locality based graph coloring

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the upper bound of the size of the r-cover-free families

Journal of Combinatorial Theory Series A
Exploiting storage redundancy to speed up randomized shared memory simulations

Theoretical Computer Science
Deterministic restrictions in circuit complexity

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized group testing for mutually obscuring defectives

Information Processing Letters
Improved algorithms for group testing with inhibitors

Information Processing Letters
Selective families, superimposed codes, and broadcasting on unknown radio networks

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Towards DNA Sequencing Chips

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Tracing Traitors

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Reconstructing strings from substrings in rounds

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Deterministic Superimposed Coding with Applications to Pattern Matching

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Group Testing Problems with Sequences in Experimental Molecular Biology

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Modulation and coding for the Gaussian collision channel

IEEE Transactions on Information Theory

Generalized framework for selectors with applications in optimal group testing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their constructions and we provide non-existential results. We apply our new combinatorial structures to the efficient solution of new group testing problems and access coordination issues in multiple access channels.