Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels

Authors:
Annalisa De Bonis;Ugo Vaccaro
Affiliations:
Dipartimento di Informatica e Applicazioni, Università di Salerno, 84081 Baronissi (SA), Italy;Dipartimento di Informatica e Applicazioni, Università di Salerno, 84081 Baronissi (SA), Italy
Venue:
Theoretical Computer Science
Year:
2003

Citing 22
Cited 13

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
Key storage in secure networks

Discrete Applied Mathematics
Locality in distributed graph algorithms

SIAM Journal on Computing
On the upper bound of the size of the r-cover-free families

Journal of Combinatorial Theory Series A
Randomized algorithms

Randomized algorithms
On r-cover-free families

Journal of Combinatorial Theory Series A
Deterministic restrictions in circuit complexity

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Visual cryptography for general access structures

Information and Computation
A simple construction of d-disjunct matrices with certain constant weights

Discrete Mathematics
Error-correcting nonadaptive group testing with de-disjunct matrices

Discrete Applied Mathematics
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
d-Disjunct matrices: bounds and Lovasz local lemma

Discrete Mathematics
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
New constructions of superimposed codes

IEEE Transactions on Information Theory

Faster deterministic wakeup in multiple access channels

Discrete Applied Mathematics
The identification of positive clones in a general inhibitor model

Journal of Computer and System Sciences
Superimposed code based channel assignment in multi-radio multi-channel wireless mesh networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A combinatorial approach to X-tolerant compaction circuits

IEEE Transactions on Information Theory
Group testing and batch verification

ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Superselectors: efficient constructions and applications

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Bounds for nonadaptive group tests to estimate the amount of defectives

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Pooling designs for clone library screening in the inhibitor complex model

Journal of Combinatorial Optimization
Faster deterministic wakeup in multiple access channels

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Almost optimal explicit selectors

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the efficiency of bit commitment reductions

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Randomized group testing both query-optimal and minimal adaptive

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Distributed sensor failure detection in sensor networks

Signal Processing

Quantified Score

Hi-index	5.29

Visualization

Abstract

In this paper we introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their construction and 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.