New Construction of Error-Tolerant Pooling Designs

DOI10.1007/978-3-642-36899-8_26zbMath1309.05037OpenAlexW44702927MaRDI QIDQ4915255

Harout Aydinian, Rudolf Ahlswede

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_26

zbMATH Keywords

group testingpooling designsnonadaptive algorithm\(d^z\)-disjunct matrix

Mathematics Subject Classification ID

Other designs, configurations (05B30) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (1)

Exact learning from an honest teacher that answers membership queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of codes with maximum rank distance
• 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
• A simple construction of \(d\)-disjunct matrices with certain constant weights
• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• On \(r\)-cover-free families
• Optimal pooling designs with error detection
• A novel use of \(t\)-packings to construct \(d\)-disjunct matrices
• Coding for Errors and Erasures in Random Network Coding
• New constructions of superimposed codes
• Nonrandom binary superimposed codes
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• New constructions of non-adaptive and error-tolerance pooling designs

This page was built for publication: New Construction of Error-Tolerant Pooling Designs