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 iss...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 306; no. 1-3; pp. 223 - 243
Main Authors De Bonis, Annalisa, Vaccaro, Ugo
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 05.09.2003
Elsevier
Subjects
Applied sciences
Coding, codes
Cover-free families
Exact sciences and technology
Group testing
Information theory
Information, signal and communications theory
Multiaccess channels
Signal and communications theory
Superimposed codes
Telecommunications and information theory
Multiaccess channels
Superimposed codes
Cover-free families
Group testing
Lower bound
Upper bound
Multichannel recording
Asymptotic bound
Coding
Test
Superimposed code
Code
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(03)00281-0