Symmetric group testing and superimposed codes

Amin Emad, Jun Shen, Olgica Milenkovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2011 IEEE Information Theory Workshop, ITW 2011
Pages20-24
Number of pages5
DOIs
StatePublished - 2011
Event2011 IEEE Information Theory Workshop, ITW 2011 - Paraty, Brazil
Duration: Oct 16 2011Oct 20 2011

Publication series

Name2011 IEEE Information Theory Workshop, ITW 2011

Other

Other2011 IEEE Information Theory Workshop, ITW 2011
CountryBrazil
CityParaty
Period10/16/1110/20/11

ASJC Scopus subject areas

  • Information Systems

Fingerprint Dive into the research topics of 'Symmetric group testing and superimposed codes'. Together they form a unique fingerprint.

Cite this