Abstract
In this paper we introduce a parameterized generalization of the well known superimposed codes. We give algorithms for their constructions and we 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.
Cite
CITATION STYLE
De Bonis, A., & Vaccaro, U. (2002). Efficient constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2461, pp. 335–347). Springer Verlag. https://doi.org/10.1007/3-540-45749-6_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
