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

DOI10.1016/S0304-3975(03)00281-0zbMath1059.68040MaRDI QIDQ1426451

Ugo Vaccaro, Annalisa De Bonis

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Group testingCover-free familiesMultiaccess channelsSuperimposed codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (19)

Adaptive group testing with a constrained number of positive responses improved ⋮ Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES ⋮ BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES ⋮ The identification of positive clones in a general inhibitor model ⋮ Applicability of a static model in a dynamic context in group-screening decision making ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Faster deterministic wakeup in multiple access channels ⋮ A survey on nonadaptive group testing algorithms through the angle of decoding ⋮ On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design ⋮ Bounds and algorithms for generalized superimposed codes ⋮ An improved zig zag approach for competitive group testing ⋮ A class of asymptotically optimal group testing strategies to identify good items ⋮ A randomized competitive group testing procedure ⋮ On optimal randomized group testing with one defective item and a constrained number of positive responses ⋮ Pooling designs for clone library screening in the inhibitor complex model ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions ⋮ A class of asymptotically optimal group screening strategies with limited item participation

Cites Work

• Improved algorithms for group testing with inhibitors
• Randomized group testing for mutually obscuring defectives
• Bounds for packet transmission rate in a random-multiple-access system
• Families of finite sets in which no set is covered by the union of \(r\) others
• Key storage in secure networks
• Separating systems
• On the upper bound of the size of the \(r\)-cover-free families
• A simple construction of \(d\)-disjunct matrices with certain constant weights
• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• \(d\)-disjunct matrices: Bounds and Lovász local lemma
• On key storage in secure networks
• On \(r\)-cover-free families
• Visual cryptography for general access structures
• Locality in Distributed Graph Algorithms
• New constructions of superimposed codes
• Exploiting storage redundancy to speed up randomized shared memory simulations
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Nonrandom binary superimposed codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.