Nonrandom binary superimposed codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Uniform hypergraphs containing no grids
- Leader election in ad hoc radio networks: a keen ear helps
- A generalization of Macula's disjunct matrices
- Pooled Testing for COVID-19 Using Coding Theory
- Error analysis for superimposed random coding
- Optimal superimposed codes and designs for Renyi's search model
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Nonadaptive algorithms for threshold group testing
- Restrained medium access control on adversarial shared channels
- New Construction of Error-Tolerant Pooling Designs
- Constructions of optimal sparse r-disjunct matrices via packings
- A zig-zag approach for competitive group testing
- Coding for a Multiple Access OR Channel: a Survey
- A new randomized algorithm for group testing with unknown number of defective items
- Coordination Problems in Ad Hoc Radio Networks
- Almost disjunctive list-decoding codes
- An upper bound on error probability in communication systems with single-user reception based on order statistics
- Improved lower bound for estimating the number of defective items
- Lower bounds for cover-free families
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Tracing a single user
- Generalized cover-free families.
- Symmetric disjunctive list-decoding codes
- Pooling spaces associated with finite geometry
- Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
- Lower bounds for graph reconstruction with maximal independent set queries
- More on pooling spaces
- Codes identifying sets of vertices in random networks
- Families of finite sets in which no intersection of sets is covered by the union of s others
- Improved upper bounds for the rate of separating and completely separating codes
- ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- A universal bound for a covering in regular posets and its application to pool testing
- Binary representations of underdetermined data and superimposed codes
- Optimal group testing
- On the extremal combinatorics of the Hamming space
- Optimal deterministic group testing algorithms to estimate the number of defectives
- Optimal deterministic group testing algorithms to estimate the number of defectives
- Better goodness-of-fit statistics for coded FSK decoding
- Obtaining reliability values from nonparametric receiver: the ``optimal parameter choice
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Distributed broadcast in radio networks of unknown topology.
- Some new bounds for cover-free families
- Generalised cumulative arrays in secret sharing
- Fast decoding of group testing results from Reed-Solomon d-disjunct matrices
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- On detecting some defective items in group testing
- Superimposed codes for the search model of a. renyi
- Almost cover-free codes
- List decoding for a multiple access hyperchannel
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Improved algorithms for group testing with inhibitors
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- Pooling spaces and non-adaptive pooling designs
- Construction of a superimposed code using partitions
- Pooled Testing and Its Applications in the COVID-19 Pandemic
- Superimposed codes and threshold group testing
- Random coding techniques for nonrandom codes
- Generalized framework for group testing: queries, feedbacks and adversaries
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
- Some constructions of mutually orthogonal Latin squares and superimposed codes
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks
- -almost selectors and their applications
- Parity-check codes from disjunct matrices
- Improved lower bound for estimating the number of defective items
- Faster deterministic wakeup in multiple access channels
- On the construction of \((w,r)\) cover-free codes
- Exact learning from an honest teacher that answers membership queries
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- On cover-free families of finite vector spaces
- Mutual inhibition with few inhibitory cells via nonlinear inhibitory synaptic interaction
- New combinatorial structures with applications to efficient group testing with inhibitors
- Sudoku associative memory
- A survey of cover-free families: constructions, applications, and generalizations
- An algorithmic construction of union-intersection-bounded families
- Non-iterative sparse signal recovery algorithms for sparse matrices and their guarantees
- Strongly separable matrices for nonadaptive combinatorial group testing
- Bounds on the rate of disjunctive codes
- Watching systems in graphs: an extension of identifying codes
- Separable collusion-secure multimedia codes
- Locating and detecting arrays for interaction faults
- Subquadratic non-adaptive threshold group testing
- The design of (almost) disjunct matrices by evolutionary algorithms
- On the upper bound of the size of the \(r\)-cover-free families
- Separating codes and a new combinatorial search model
- On the upper bounds of the minimum number of rows of disjunct matrices
- On the complexity of neighbourhood learning in radio networks
- A new construction for pooling designs
- A class of error-correcting pooling designs over complexes
- On some connections between permutations and coding
- Application of cover-free codes and combinatorial designs to two-stage testing.
- Hardness of approximate two-level logic minimization and PAC learning with membership queries
- Structure-aware combinatorial group testing: a new method for pandemic screening
- Real-valued group testing for quantitative molecular assays
- Threshold and Majority Group Testing
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Optimal Message-Passing with Noisy Beeps
This page was built for publication: Nonrandom binary superimposed codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5342842)
