An efficient algorithm for group testing with runlength constraints

DOI10.1016/J.DAM.2024.09.001MaRDI QIDQ6648259zbMATH OpenFDO

Authors Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro

Publication date 4 December 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.09.001

zbMATH Keywords

group testingLovász local lemmarunlength-constrained codessuperimposed codes

Mathematics Subject Classification ID

Other designs, configurations (05B30) Randomized algorithms (68W20) Other types of codes (94B60)

Recommendations

• Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
• scientific article; zbMATH DE number 1947404
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• Construction and application of the binary \(\left({p,r,d} \right)\)-code
• Linear properties of the binary superimposed code M_q(n,k, d)

Cites work

• \(d\)-disjunct matrices: Bounds and Lovász local lemma
• A constructive proof of the general Lovász local lemma
• A survey of cover-free families: constructions, applications, and generalizations
• Enumerative source encoding
• Families of finite sets in which no set is covered by the union of \(r\) others
• Group testing: an information theory perspective
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• Nonrandom binary superimposed codes
• On the upper bounds of the minimum number of rows of disjunct matrices
• Some Completeness Results on Decision Trees and Group Testing
• Superimposed codes and threshold group testing

This page was built for publication: An efficient algorithm for group testing with runlength constraints

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