Nonrandom binary superimposed codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Construction of a superimposed code using partitions
- The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks
- On the upper bounds of the minimum number of rows of disjunct matrices
- Nonadaptive algorithms for threshold group testing
- 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
- Non-adaptive learning of a hidden hypergraph
- Better goodness-of-fit statistics for coded FSK decoding
- Obtaining reliability values from nonparametric receiver: the ``optimal parameter choice
- Some new bounds for cover-free families through biclique covers
- 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
- On 2-parent-identifying set systems of block size 4
- Union-intersection-bounded families and their applications
- Separable collusion-secure multimedia codes
- A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
- Generalized framework for group testing: queries, feedbacks and adversaries
- Structure-aware combinatorial group testing: a new method for pandemic screening
- Real-valued group testing for quantitative molecular assays
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- Bounds on the rate of disjunctive codes
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Group testing with geometry of classical groups over finite fields
- A new randomized algorithm for group testing with unknown number of defective items
- List decoding for a multiple access hyperchannel
- Almost cover-free codes
- Non-adaptive group testing on graphs with connectivity
- 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
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Watching systems in graphs: an extension of identifying codes
- Strict group testing and the set basis problem
- 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
- Almost disjunctive list-decoding codes
- Lower bounds for cover-free families
- Exact learning from an honest teacher that answers membership queries
- Strongly separable matrices for nonadaptive combinatorial group testing
- Tropical complexity, Sidon sets, and dynamic programming
- Non-adaptive learning of a hidden hypergraph
- 2-cancellative hypergraphs and codes
- Improved algorithms for group testing with inhibitors
- A zig-zag approach for competitive group testing
- Linear Time Constructions of Some d-Restriction Problems
- -almost selectors and their applications
- Non-Overlapping Codes
- Error analysis for superimposed random coding
- A new construction for pooling designs
- Some constructions of mutually orthogonal Latin squares and superimposed codes
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
- ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES
- On Efficient Gossiping in Radio Networks
- Coding for a Multiple Access OR Channel: a Survey
- Codes Identifying Vertices in Graphs
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
- On the Probability Distribution of Superimposed Random Codes
- Synthetic sequence design for signal location search
- Uniform hypergraphs containing no grids
- Leader election in ad hoc radio networks: a keen ear helps
- A generalization of Macula's disjunct matrices
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- Random coding techniques for nonrandom codes
- 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
- A new strongly competitive group testing algorithm with small sequentiality
- Pooled Testing and Its Applications in the COVID-19 Pandemic
- Symmetric disjunctive list-decoding codes
- Almost cover-free codes and designs
- Smart elements in combinatorial group testing problems with more defectives
- Almost separable matrices
- New Turán Exponents for Two Extremal Hypergraph Problems
- Binary representations of underdetermined data and superimposed codes
- Codes with the identifiable parent property for multimedia fingerprinting
- Mutual inhibition with few inhibitory cells via nonlinear inhibitory synaptic interaction
- Construction and application of the binary \(\left({p,r,d} \right)\)-code
- Almost optimal cover-free families
- Coordination Problems in Ad Hoc Radio Networks
- RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES
- Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
- Superimposed codes for the search model of a. renyi
- Optimal group testing
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)
