Superimposed codes and threshold group testing

DOI10.1007/978-3-642-36899-8_25MaRDI QIDQ4915254zbMATH OpenOpenAlexFDO

Authors Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir Lebedev

Publication date 9 April 2013

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

Full work available at URL https://arxiv.org/abs/1401.7485

zbMATH Keywords

bounds on the ratecompressed genotypinggroup testingrate of codesrate of designsscreening experimentssearch designsshortened RC-codesuperimposed codesthreshold search designs

Mathematics Subject Classification ID

General biostatistics (92B15) Information theory (general) (94A15) Other types of codes (94B60) Fault detection; testing in circuits and networks (94C12)

Abstract: We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper bound on the rate of superimposed codes published in 1982. We were also inspired by recent results obtained for non-adaptive threshold group testing which develop the theory of superimposed codes

Recommendations

• Publication:4945068
• scientific article; zbMATH DE number 2154117
• Construction and application of the binary \(\left({p,r,d} \right)\)-code
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• Linear properties of the binary superimposed code M_q(n,k, d)

Cites work

• A Mathematical Theory of Communication
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds
• Compressed Genotyping
• Families of finite sets in which no intersection of sets is covered by the union of s others
• scientific article; zbMATH DE number 4162826 (Why is no real title available?)
• scientific article; zbMATH DE number 3908323 (Why is no real title available?)
• scientific article; zbMATH DE number 4064918 (Why is no real title available?)
• scientific article; zbMATH DE number 4085057 (Why is no real title available?)
• scientific article; zbMATH DE number 3703793 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• scientific article; zbMATH DE number 1420996 (Why is no real title available?)
• scientific article; zbMATH DE number 3205803 (Why is no real title available?)
• New constructions of superimposed codes
• Nonadaptive algorithms for threshold group testing
• Nonrandom binary superimposed codes
• On optimal superimposed codes
• On the optimality of trivial \((w,r)\)-cover-free codes
• Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
• Optimal superimposed codes and designs for Renyi's search model
• Separating codes and a new combinatorial search model
• Threshold and Majority Group Testing
• Threshold Group Testing

Cited in

(6)

• Bounds on the rate of separating codes
• Bounds on the rate of disjunctive codes
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
• Threshold and Majority Group Testing
• scientific article; zbMATH DE number 1420996 (Why is no real title available?)
• An efficient algorithm for group testing with runlength constraints

This page was built for publication: Superimposed codes and threshold group testing

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