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

Bonis, Annalisa De; Vaccaro, Ugo

doi:10.1007/3-540-45749-6_32

Cited by 7 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A single test consists in choosing any subset S ⊂ N and testing if any object from S is infected. An oblivious algorithm solving the group testing problem, based on superimposed codes with length O(d 2 log n), where n = |N |, is presented in [1], [2].…”

Section: Relations To Other Problemsmentioning

confidence: 99%

See 1 more Smart Citation

On ?-Alert Problem

Klonowski

Pająk²

2012

2012 IEEE 26th International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

In this paper we introduce and analyse the λ-Alert problem: in a single hop radio network a subset of stations is activated. The aim of the protocol is to decide if the number of activated stations is greater or equal to λ. This problem is similar to the k-Selection problem. It can also be seen as an extension of the standard Alert problem. In our paper we consider the λ-Alert problem in various settings. We describe characteristics of oblivious and adaptive deterministic algorithms for the model with and without collision detection. We also show some results for randomized algorithms. In particular, we present a very efficient Las Vegastype algorithm which is immune to an adversary.

show abstract

Section: Relations To Other Problemsmentioning

confidence: 99%

“…We need to show that such codes exists. But constructions of superimposed codes can be found in literature for example in [2].…”

Section: A No Collision Detectionmentioning

confidence: 99%

On ?-Alert Problem

Klonowski

Pająk²

2012

2012 IEEE 26th International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

“…The issues discussed in [20] are also important for their relations with Coding Theory, in particular with combinatorial structures like superimposed codes [10,21] and its applications to combinatorial group testing. The reader interested can refer to the excellent book of Du and Hwang [8] (specially Chapter 4 and 5) for a more detailed study of the implications involved, and to the works of Indyk [17] and De Bonis and Vaccaro [6] for recent developments and generalizations.…”

Section: Related Workmentioning

confidence: 99%

Faster deterministic wakeup in multiple access channels

Marco¹,

Pellegrini²,

Sburlati³

2007

Discrete Applied Mathematics

View full text Add to dashboard Cite

We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in which no global clock is available: processors have local clocks ticking at the same rate, but each clock starts counting the rounds in the round in which the correspondent processor wakes up. Moreover, the number n of processors is not known to the processors. We propose a new deterministic algorithm for this problem, which improves on the currently best upper bound.

show abstract

“…The reader interested can refer to the excellent book of Du and Hwang [8] (specially Chapter 4 and 5) for a more detailed study of the implications involved, and to the works of Indyk [17] and De Bonis and Vaccaro [6] for recent developments and generalizations.…”

Section: Related Workmentioning

confidence: 99%