Optimal superimposed codes and designs for Renyi's search model

DOI10.1016/S0378-3758(01)00140-9zbMath0998.94043OpenAlexW2032060600MaRDI QIDQ5957831

Vyacheslav V. Rykov, Arkadii G. D'yachkov

Publication date: 27 August 2002

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(01)00140-9

zbMATH Keywords

homogeneous codessuperimposed codessuperimposed designs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Other types of codes (94B60)

Related Items (4)

Finding one of \(D\) defective elements in some group testing models ⋮ Identifying defective sets using queries of small size ⋮ Uniform hypergraphs containing no grids ⋮ Superimposed Codes and Threshold Group Testing

Cites Work

• A simple construction of \(d\)-disjunct matrices with certain constant weights
• Nonrandom binary superimposed codes
• On the theory of random search
• On separating systems of a finite set
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal superimposed codes and designs for Renyi's search model