Low-weight superimposed codes and related combinatorial structures: bounds and applications
From MaRDI portal
Publication:2285161
DOI10.1016/j.tcs.2019.10.032zbMath1455.94093OpenAlexW2980659838WikidataQ126994169 ScholiaQ126994169MaRDI QIDQ2285161
Ugo Vaccaro, Luisa Gargano, Adele A. Rescigno
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.10.032
Related Items (2)
Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Bounds and algorithms for generalized superimposed codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved algorithms for group testing with inhibitors
- Randomized group testing for mutually obscuring defectives
- Time efficient \(k\)-shot broadcasting in known topology radio networks
- Energy-efficient broadcasting in ad hoc wireless networks
- Pattern matching with don't cares and few errors
- On the complexity of neighbourhood learning in radio networks
- On the upper bounds of the minimum number of rows of disjunct matrices
- Families of finite sets in which no set is covered by the union of \(r\) others
- Bounds for error probability for a symmetrical model in designing screening experiments
- On the upper bound of the size of the \(r\)-cover-free families
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- 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.
- On \(k\)-strong conflict-free multicoloring
- Cover-free families and topology-transparent scheduling for MANETs
- On \(r\)-cover-free families
- Bounds on the rate of disjunctive codes
- Erratum to: ``Bounds on the rate of disjunctive codes
- Linear Time Constructions of Some $$d$$-Restriction Problems
- A Sequential Method for Screening Experimental Variables
- On Conflict-Free Multi-coloring
- A constructive proof of the general lovász local lemma
- Combinatorial Algorithms for Compressed Sensing
- The collision channel without feedback
- Born again group testing: Multiaccess communications
- Locality in Distributed Graph Algorithms
- $\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication
- Maximally Efficient Two‐Stage Screening
- Exponential separations in the energy complexity of leader election
- An Optimization Problem Related to Bloom Filters with Bit Patterns
- Exact and Approximate Pattern Matching in the Streaming Model
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- The Energy Complexity of Broadcast
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Optimal Two-Stage Algorithms for Group Testing Problems
- Learning a Hidden Subgraph
- Nonrandom binary superimposed codes
- Contention resolution with log-logstar channel accesses
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- Fundamentals of Computation Theory
- Applied Cryptography and Network Security
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- Efficient \(k\)-shot broadcasting in radio networks
This page was built for publication: Low-weight superimposed codes and related combinatorial structures: bounds and applications
