Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels
In this paper we introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their construction and provide non-existential results. We apply our new combinatorial structures to the efficient solution of new group testing problems and access coordination issues in multiple access channels. (C) 2003 Elsevier B.V. All rights reserved.
superimposed codes group testing multiaccess channels cover-free families