2011/08/15 by Amin Emad, Jun Shen, Emad, Amin +3
Biochemistry, Genetics and Molecular Biology · Engineering · Medicine · #Advanced biosensing and bioanalysis techniques #Biosensors and Analytical Detection #FOS: Computer and information sciences #Information Theory (cs.IT) #SARS-CoV-2 detection and testing
paper · pdf · doi:10.48550/arxiv.1108.2996
openalex publication_date 2011/08/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a ternary alphabet. Using an information-theoretic approach, we derive sufficient and necessary conditions for the number of tests required for noise-free and noisy reconstructions. Furthermore, we extend the notion of disjunct (zero-false-drop) and separable (uniquely decipherable) codes to the case of symmetric group testing. For the new family of codes, we derive bounds on their size based on probabilistic methods, and provide construction methods based on coding theoretic ideas.