Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
type: Item
instance of: scholarly article
title: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
zbMATH Open document ID: 1059.68040
DOI: 10.1016/S0304-3975(03)00281-0
author: Annalisa De Bonis
author: Ugo Vaccaro
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 2056798
zbMATH Keywords: Group testing
zbMATH Keywords: Multiaccess channels
zbMATH Keywords: Superimposed codes
zbMATH Keywords: Cover-free families
MaRDI profile type: Publication
cites work: Visual cryptography for general access structures
cites work: Q5687002
cites work: Q4063504
cites work: Q3361866
cites work: Q4228451
cites work: Q3028697
cites work: Q4788606
cites work: Q4940701
cites work: Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
cites work: Randomized group testing for mutually obscuring defectives
cites work: Improved algorithms for group testing with inhibitors
cites work: Q4010313
cites work: New constructions of superimposed codes
cites work: Q4945068
cites work: Q4745752
cites work: Q3039244
cites work: On key storage in secure networks
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: On \(r\)-cover-free families
cites work: Q5457049
cites work: Q3780312
cites work: Nonrandom binary superimposed codes
cites work: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
cites work: Q4941882
cites work: Locality in Distributed Graph Algorithms
cites work: A simple construction of \(d\)-disjunct matrices with certain constant weights
cites work: Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
cites work: Q4252746
cites work: Exploiting storage redundancy to speed up randomized shared memory simulations
cites work: Key storage in secure networks
cites work: Q4856179
cites work: On the upper bound of the size of the \(r\)-cover-free families
cites work: Separating systems
cites work: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
cites work: Bounds for packet transmission rate in a random-multiple-access system
cites work: \(d\)-disjunct matrices: Bounds and Lovász local lemma
description: scientific article; zbMATH DE number 2056798