Information-theoretic and algorithmic aspects of parallel and distributed reconstruction from pooled data

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 total number of non-zero entries in the query as a result. We assume that queries are time-consuming and therefore...

Full description

Bibliographic Details

Published in:	Journal of parallel and distributed computing Vol. 180; p. 104718
Main Authors:	Gebhard, Oliver, Hahn-Klimroth, Max, Kaaser, Dominik, Loick, Philipp
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.10.2023
Subjects:	Noisy pooled data Non-adaptive algorithm Pooled data Quantitative group testing Quantitative group testing Pooled data Non-adaptive algorithm Noisy pooled data
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!