Add to ORKGd-disjunct matrices, d-separable matrices and d-separable matrices are well studied in various problems including group testing, coding, extremal set theory and recently, DNA sequencing. The implications from the rst two matrices to the last one are well documented. This paper gives an implication of the other direction for the rst time.
A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive...
Random matrix theory has many roots and many branches in mathematics, statistics, physics, computer ...
AbstractWe give a simple method of constructing d-disjunct matrices. For k > d, our construction yie...
Abstractd-disjunct matrices constitute a basis for nonadaptive group testing (NGT) algorithms and bi...
AbstractA binary matrix is said to be d-disjunct if the union (or Boolean sum) of any d columns does...
An m × n matrix A with column supports {Si} is k-separable if the disjunctions i∈K Si are all distin...
This thesis discusses matrix properties as they relate to the idea of non-adaptive group testing. Th...
Pooling design is a very helpful tool for reducing the number of tests for DNA library screening. A ...
A k x n matrix is an MDS matrix if any k columns are linearly independent. Such matrices span MDS (M...
This is an English translation of the Bourbaki seminar 1129 (March 2017). The French version will ap...
AbstractA t-packing is an ordered pair (V,P) where V is a v-set and P is a collection of k-subsets (...
In this paper, we observe simple yet subtle interconnections among design theory, coding theory and ...
The Maximum Distance Separable (MDS) code is one of the codes that known as error-correcting code wh...
<p><i>i</i> is an index for three partitions (groupings) of the data based on amino acid physiochemi...
In this paper, we establish that the following fitting problem is NP-hard: given a finite set X and ...
A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive...
Random matrix theory has many roots and many branches in mathematics, statistics, physics, computer ...
AbstractWe give a simple method of constructing d-disjunct matrices. For k > d, our construction yie...
Abstractd-disjunct matrices constitute a basis for nonadaptive group testing (NGT) algorithms and bi...
AbstractA binary matrix is said to be d-disjunct if the union (or Boolean sum) of any d columns does...
An m × n matrix A with column supports {Si} is k-separable if the disjunctions i∈K Si are all distin...
This thesis discusses matrix properties as they relate to the idea of non-adaptive group testing. Th...
Pooling design is a very helpful tool for reducing the number of tests for DNA library screening. A ...
A k x n matrix is an MDS matrix if any k columns are linearly independent. Such matrices span MDS (M...
This is an English translation of the Bourbaki seminar 1129 (March 2017). The French version will ap...
AbstractA t-packing is an ordered pair (V,P) where V is a v-set and P is a collection of k-subsets (...
In this paper, we observe simple yet subtle interconnections among design theory, coding theory and ...
The Maximum Distance Separable (MDS) code is one of the codes that known as error-correcting code wh...
<p><i>i</i> is an index for three partitions (groupings) of the data based on amino acid physiochemi...
In this paper, we establish that the following fitting problem is NP-hard: given a finite set X and ...
A real symmetric matrix is separable if it can be written as a sum of Kronecker products of positive...
Random matrix theory has many roots and many branches in mathematics, statistics, physics, computer ...
AbstractWe give a simple method of constructing d-disjunct matrices. For k > d, our construction yie...