Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels

AbstractIn 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