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 e5cient solution of new group testing problems and access coordination issues in multiple access channels. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Cover-Free Families and Superimposed Codes: Constructions, Bounds, and Applications to Cryptography and Group Testing
This paper deals with (s, `)-cover-free families or superimposed (s, `)-codes. They generalize the concept of superimposed s-codes and have several applications for cryptography and group testing. We present a new asymptotic bound on the rate of optimal codes and develop some constructions.
متن کاملImproved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis
We study group-testing algorithms for resolving broadcast conflicts on a multiple access channel (MAC) and for identifying the dead sensors in a mobile ad hoc wireless network. In group-testing algorithms, we are asked to identify all the defective items in a set of items when we can test arbitrary subsets of items. In the standard group-testing problem, the result of a test is binary—the teste...
متن کاملGeneralized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions
We consider the Conflict Resolution Problem in the context of a multiple-access system in which several stations can transmit their messages simultaneously to the channel. We assume that there are n stations and that at most k, k ≤ n, stations are active at the same time, i.e, are willing to transmit a message over the channel. If in a certain instant at most d, d ≤ k, active stations transmit ...
متن کاملLectures on Designing Screening Experiments
Preface Designing Screening Experiments (DSE) is a class of information-theoretical models for multiple-access channels (MAC). In Sect. 2-4, we discuss the combinatorial model of DSE called a disjunct channel model. This model is the most important for applications and closely connected with the superimposed code concept. In Sect. 2, we give a detailed survey of lower and upper bounds on the ra...
متن کاملEmerging Optical CDMA Techniques and Applications
In this paper we present an in-depth review on the trends and the directions taken by the researchers worldwide in Optical Code Division Multiple Access (OCDMA) systems. We highlight those trends and features that are believed to be essential to the successful introduction of various OCDMA techniques in communication systems and data networks in near future. In particular we begin by giving a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 306 شماره
صفحات -
تاریخ انتشار 2003