d-Disjunct matrices: bounds and Lovasz local lemma
Discrete Mathematics
Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
A group testing method for finding patterns in data
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Uniqueness of some optimal superimposed codes
Problems of Information Transmission
Superimposed code based channel assignment in multi-radio multi-channel wireless mesh networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Coding for a multiple access OR channel: A survey
Discrete Applied Mathematics
A group testing method for finding patterns in data
Discrete Applied Mathematics
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
A combinatorial approach to X-tolerant compaction circuits
IEEE Transactions on Information Theory
An efficient single-key pirates tracing scheme using cover-free families
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
Superimposed codes and threshold group testing
Information Theory, Combinatorics, and Search Theory
New construction of error-tolerant pooling designs
Information Theory, Combinatorics, and Search Theory
| Hi-index | 754.90 |
Kautz-Singleton (1964) suggested a class of binary superimposed codes which are based on the q-ary Reed-Solomon codes (RS codes). Applying a concatenation of the binary constant-weight error-correcting codes and the shortened RS codes, we obtain new constructions of superimposed codes. Tables of their parameters are given. From the tables it follows that the rate of obtained codes exceeds the corresponding random coding bound