Nonrandom binary superimposed codes
From MaRDI portal
Publication:5342842
DOI10.1109/TIT.1964.1053689zbMath0133.12402OpenAlexW1968160142MaRDI QIDQ5342842
R. C. Singleton, William H. Kautz
Publication date: 1964
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1964.1053689
Related Items (only showing first 100 items - show all)
Optimal group testing ⋮ Almost Optimal Cover-Free Families ⋮ Pooled Testing and Its Applications in the COVID-19 Pandemic ⋮ The design of (almost) disjunct matrices by evolutionary algorithms ⋮ Restrained medium access control on adversarial shared channels ⋮ Bounds and algorithms for generalized superimposed codes ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ Optimal Message-Passing with Noisy Beeps ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ Unnamed Item ⋮ New Turán Exponents for Two Extremal Hypergraph Problems ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Threshold and Majority Group Testing ⋮ Superimposed Codes and Threshold Group Testing ⋮ New Construction of Error-Tolerant Pooling Designs ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ 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 ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Optimal superimposed codes and designs for Renyi's search model ⋮ Subquadratic non-adaptive threshold group testing ⋮ Optimal deterministic group testing algorithms to estimate the number of defectives ⋮ Optimal deterministic group testing algorithms to estimate the number of defectives ⋮ Mutual Inhibition with Few Inhibitory Cells via Nonlinear Inhibitory Synaptic Interaction ⋮ Hardness of approximate two-level logic minimization and PAC learning with membership queries ⋮ RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES ⋮ Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel ⋮ Unnamed Item ⋮ On the upper bound of the size of the \(r\)-cover-free families ⋮ 2-Cancellative Hypergraphs and Codes ⋮ List decoding for a multiple access hyperchannel ⋮ Almost cover-free codes ⋮ An upper bound on error probability in communication systems with single-user reception based on order statistics ⋮ SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES ⋮ Improved algorithms for group testing with inhibitors ⋮ Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Lower bounds for cover-free families ⋮ On the extremal combinatorics of the Hamming space ⋮ Pattern matching with don't cares and few errors ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Tracing a single user ⋮ Generalised cumulative arrays in secret sharing ⋮ A simple construction of \(d\)-disjunct matrices with certain constant weights ⋮ Two applications of separating systems to nonadaptive procedures ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Codes identifying sets of vertices in random networks ⋮ Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Real-valued group testing for quantitative molecular assays ⋮ Strongly separable matrices for nonadaptive combinatorial group testing ⋮ Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices ⋮ A Zig-Zag Approach for Competitive Group Testing ⋮ Synthetic sequence design for signal location search ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Faster deterministic wakeup in multiple access channels ⋮ Uniform hypergraphs containing no grids ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Sudoku associative memory ⋮ Separating codes and a new combinatorial search model ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ On the complexity of neighbourhood learning in radio networks ⋮ A generalization of Macula's disjunct matrices ⋮ Non-adaptive group testing on graphs with connectivity ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ 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 ⋮ Non-adaptive learning of a hidden hypergraph ⋮ On deterministic sketching and streaming for sparse recovery and norm estimation ⋮ Watching systems in graphs: an extension of identifying codes ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Generalized cover-free families. ⋮ Uniqueness of some optimal superimposed codes ⋮ Strict group testing and the set basis problem ⋮ Pooling spaces associated with finite geometry ⋮ Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ Group testing with random pools: Phase transitions and optimal strategy ⋮ Some new bounds for cover-free families ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ Error analysis for superimposed random coding ⋮ Better goodness-of-fit statistics for coded FSK decoding ⋮ Obtaining reliability values from nonparametric receiver: the ``optimal parameter choice ⋮ General theory of information transfer: Updated ⋮ Coding for a multiple access OR channel: A survey ⋮ Symmetric disjunctive list-decoding codes ⋮ Almost cover-free codes and designs ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Almost separable matrices ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ Some new bounds for cover-free families through biclique covers ⋮ Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Bounds on the rate of disjunctive codes ⋮ Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism ⋮ A novel use of \(t\)-packings to construct \(d\)-disjunct matrices
This page was built for publication: Nonrandom binary superimposed codes
