Symmetric Group Testing and Superimposed Codes

Details Symmetric Group Testing and Superimposed Codes Symmetric Group Testing and Superimposed Codes

2011-08-15

arxiv.org/abs/1108.2996v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Symmetric Group Testing and Superimposed Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symmetric Group Testing and Superimposed Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetric Group Testing and Superimposed Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-301711