Separating codes and a new combinatorial search model

DOI10.1134/S0032946010010011zbMath1241.94040OpenAlexW1981136234MaRDI QIDQ619509

Vladimir Lebedev

Publication date: 25 January 2011

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946010010011

zbMATH Keywords

group testingseparating codescover-free codes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)

Related Items (2)

Threshold and Majority Group Testing ⋮ Superimposed Codes and Threshold Group Testing

Cites Work

• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Nonadaptive algorithms for threshold group testing
• Families of finite sets in which no set is covered by the union of \(r\) others
• Completely separating systems
• On pair-separating codes
• Some new bounds for cover-free families
• On optimal superimposed codes
• Intersecting codes and independent families
• Nonrandom binary superimposed codes
• Some new results on superimposed codes
• Threshold Group Testing
• Guessing secrets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Separating codes and a new combinatorial search model