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. © 2003 Elsevier B.V. All rights reserved.
De Bonis, A., & Vaccaro, U. (2003). Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theoretical Computer Science, 306(1–3), 223–243. https://doi.org/10.1016/S0304-3975(03)00281-0