On the essential test sets of discrete matrices

DOI10.1016/0166-218X(94)00055-IMaRDI QIDQ1894367zbMATH OpenFDO

Authors Alex Kogan

Publication date 7 January 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

treesdiscrete matricesessential test set

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• Disjunct and selective matrices
• On the upper bounds of the minimum number of rows of disjunct matrices
• Some properties of Macula's matrix and its complement
• Test sets for generalized matrix functions
• Study of the bounds on the number of basic sets in a test.

Cites work

• scientific article; zbMATH DE number 3961508 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 3693155 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Identification Keys and Diagnostic Tables: A Review

Cited in

(3)

• Identification of points using disks
• Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets
• Discriminating codes in bipartite graphs

This page was built for publication: On the essential test sets of discrete matrices

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