Nonrandom binary superimposed codes
From MaRDI portal
Publication:5342842
DOI10.1109/TIT.1964.1053689zbMath0133.12402MaRDI QIDQ5342842
William H. Kautz, R. C. Singleton
Publication date: 1964
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items
Unnamed Item, RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES, Explicit constructions of perfect hash families from algebraic curves over finite fields, Efficient algorithms for chemical threshold testing problems, Superimposed codes for the search model of a. renyi, Optimal superimposed codes and designs for Renyi's search model, Hardness of approximate two-level logic minimization and PAC learning with membership queries, Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others, Tracing a single user, Generalised cumulative arrays in secret sharing, Codes identifying sets of vertices in random networks, Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices, Faster deterministic wakeup in multiple access channels, Uniqueness of some optimal superimposed codes, Pooling spaces associated with finite geometry, Group testing with random pools: Phase transitions and optimal strategy, General theory of information transfer: Updated, Coding for a multiple access OR channel: A survey, More on pooling spaces, Construction of a superimposed code using partitions, The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks, On some connections between permutations and coding, Non-adaptive group testing in the presence of errors, On the upper bound of the size of the \(r\)-cover-free families, A simple construction of \(d\)-disjunct matrices with certain constant weights, Two applications of separating systems to nonadaptive procedures, Distributed broadcast in radio networks of unknown topology., Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels., Generalized cover-free families., Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism, A universal bound for a covering in regular posets and its application to pool testing, Application of cover-free codes and combinatorial designs to two-stage testing., Pooling spaces and non-adaptive pooling designs, On the extremal combinatorics of the Hamming space, Some new bounds for cover-free families, Locating and detecting arrays for interaction faults, On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design, New combinatorial structures with applications to efficient group testing with inhibitors, Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis, An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution, A novel use of \(t\)-packings to construct \(d\)-disjunct matrices, A classification of the structures of some Sperner families and superimposed codes, Deterministic M2M multicast in radio networks, Coding for a Multiple Access OR Channel: a Survey, Codes Identifying Vertices in Graphs
