On the upper bounds of the minimum number of rows of disjunct matrices

DOI10.1007/s11590-008-0109-2zbMath1221.15029OpenAlexW1966840469MaRDI QIDQ1024738

Yongxi Cheng, Ding-Zhu Du, Guo-Hui Lin

Publication date: 17 June 2009

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-008-0109-2

zbMATH Keywords

Boolean matricessuperimposed codescover free families0-1 matrixdisjunct matricesBoolean sum\(q\)-ary matrices

Mathematics Subject Classification ID

Miscellaneous inequalities involving matrices (15A45) Boolean and Hadamard matrices (15B34)

Related Items

Bounds and algorithms for generalized superimposed codes, Low-weight superimposed codes and related combinatorial structures: bounds and applications, Unnamed Item

Cites Work

• 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
• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• On \(r\)-cover-free families
• Born again group testing: Multiaccess communications
• New constructions of superimposed codes
• Nonrandom binary superimposed codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item