Bounds and algorithms for generalized superimposed codes
From MaRDI portal
Publication:6161430
DOI10.1016/j.ipl.2023.106365OpenAlexW4318035825MaRDI QIDQ6161430
Ugo Vaccaro, Adele A. Rescigno
Publication date: 5 June 2023
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106365
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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.
- Cover-free families and topology-transparent scheduling for MANETs
- On \(r\)-cover-free families
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Linear Time Constructions of Some $$d$$-Restriction Problems
- A constructive proof of the general lovász local lemma
- Locality in Distributed Graph Algorithms
- Sparse Combinatorial Group Testing
- Nearly Optimal Sparse Group Testing
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Learning a Hidden Subgraph
- Nonrandom binary superimposed codes
This page was built for publication: Bounds and algorithms for generalized superimposed codes
