Bounds and algorithms for generalized superimposed codes

DOI10.1016/J.IPL.2023.106365MaRDI QIDQ6161430zbMATH OpenOpenAlexFDO

Authors Adele A. Rescigno, Ugo Vaccaro

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

zbMATH Keywords

algorithmsLas Vegas algorithmresamplingsuperimposed codes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A constructive proof of the general Lovász local lemma
• 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
• Distributed broadcast in radio networks of unknown topology.
• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• Explicit Nonadaptive Combinatorial Group Testing Schemes
• Families of finite sets in which no set is covered by the union of \(r\) others
• scientific article; zbMATH DE number 1256716 (Why is no real title available?)
• scientific article; zbMATH DE number 3801449 (Why is no real title available?)
• scientific article; zbMATH DE number 1418320 (Why is no real title available?)
• scientific article; zbMATH DE number 956611 (Why is no real title available?)
• Learning a Hidden Subgraph
• Linear Time Constructions of Some d-Restriction Problems
• Locality in Distributed Graph Algorithms
• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• Nearly Optimal Sparse Group Testing
• Nonrandom binary superimposed codes
• On r-cover-free families
• On the complexity of neighbourhood learning in radio networks
• On the upper bound of the size of the \(r\)-cover-free families
• On the upper bounds of the minimum number of rows of disjunct matrices
• Pattern matching with don't cares and few errors
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Sparse Combinatorial Group Testing

Cited in

(9)

• An improved analysis of least squares superposition codes with Bernoulli dictionary
• A classification of the structures of some Sperner families and superimposed codes
• Linear properties of the binary superimposed code M_q(n,k, d)
• A Unifying Order-Theoretic Framework for Superposition Coding: Polymatroidal Structure and Optimality in the Multiple-Access Channel With General Message Sets
• scientific article; zbMATH DE number 55892 (Why is no real title available?)
• Optimal superimposed codes and designs for Renyi's search model
• A survey of cover-free families: constructions, applications, and generalizations
• Constructions of optimal sparse r-disjunct matrices via packings
• Uniqueness of some optimal superimposed codes

This page was built for publication: Bounds and algorithms for generalized superimposed codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161430)