In this work we address the question whether a simple shared channel could be efficiently
utilized, that is, with a constant throughput and linear packet latency. A shared channel (also …

In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive
measurements. Given a signal σ∈{0, 1} n, we can query multiple entries at once and get the …

We consider single-hop radio networks with multiple channels as a model of wireless
networks. There are n stations connected to b radio channels that do not provide collision …

Group Testing (GT) is about learning a (hidden) subset $ K $, of size $ k $, of some large
domain $ N $, of size $ n\gg k $, using a sequence of queries. A result of a query provides …

The group testing problem is concerned with identifying a small set of infected individuals in
a large population. At our disposal is a testing procedure that allows us to test several …

We consider threshold group testing–a generalization of a well known and thoroughly
examined problem of combinatorial group testing. In the classical setting, the goal is to …

Multiple access channel is a well-known communication model that deploys properties of
many network systems, such as Aloha multi-access systems, local area Ethernet networks …

In the pooled data problem we are given a set of n agents, each of which holds a hidden
state bit, either 0 or 1. A querying procedure returns for a query set the sum of the states of …

We consider threshold group testing–a generalization of group testing, which asks to identify
a set of positive individuals in a population, by performing tests on pools of elements. Each …

We study non-adaptive pooling strategies for detection of rare faulty items. Given a binary
sparse N dimensional signal x, how to construct a sparse binary M× N pooling matrix F such …