Note: Exploring the missing link among d-separable, d-separable and d-disjunct matrices
Discrete Applied Mathematics
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics
General theory of information transfer: Updated
Discrete Applied Mathematics
Coding for a multiple access OR channel: A survey
Discrete Applied Mathematics
Pooling spaces associated with finite geometry
European Journal of Combinatorics
The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks
Discrete Applied Mathematics
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Journal of Computer and System Sciences
Nonadaptive algorithms for threshold group testing
Discrete Applied Mathematics
Slot synchronized topology-transparent scheduling for sensor networks
Computer Communications
Pattern matching with don't cares and few errors
Journal of Computer and System Sciences
Data forensics constructions from cryptographic hashing and coding
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
A variant of non-adaptive group testing and its application in pay-television via internet
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Watching systems in graphs: An extension of identifying codes
Discrete Applied Mathematics
Testers and their applications
Proceedings of the 5th conference on Innovations in theoretical computer science
Threshold and majority group testing
Information Theory, Combinatorics, and Search Theory
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
Group testing with multiple mutually-obscuring positives
Information Theory, Combinatorics, and Search Theory
| Hi-index | 754.84 |
A binary superimposed code consists of a set of code words whose digit-by-digit Boolean sums(1 + 1 = 1)enjoy a prescribed level of distinguishability. These codes find their main application in the representation of document attributes within an information retrieval system, but might also be used as a basis for channel assignments to relieve congestion in crowded communications bands. In this paper some basic properties of nonrandom codes of this family are presented, and formulas and bounds relating the principal code parameters are derived. Finally, there are described several such code families based upon (1)q-nary conventional error-correcting codes, (2) combinatorial arrangements, such as block designs and Latin squares, (3) a graphical construction, and (4) the parity-check matrices of standard binary error-correcting codes.