Name
Abstract | ||
|---|---|---|
A k2 m ×n (0,1) matrix is called a binary orthogonal array of strength m if in any m columns of the matrix every one of the possible 2 m ordered (0,1) m -tuples occurs in exactly k rows and no two rows are identical. In this paper, the enumeration of binary orthogonal arrays is studied, and a closed expression for the enumeration of binary orthogonal arrays of strength 1 is given using the inclusion–exclusion principle and the edge-induced subgraph. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0012-365X(01)00045-0 | Discrete Mathematics |
Keywords | Field | DocType |
edge-induced subgraph,05a15,inclusion–exclusion principle,05b15,connected component,enumeration,binary orthogonal array,94a60,binary orthogonal arrays,orthogonal array,inclusion exclusion principle | Row,Discrete mathematics,Orthogonal array,Combinatorics,Tuple,Matrix (mathematics),Enumeration,Connected component,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
239 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.41 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian-Zhou Zhang | 1 | 22 | 5.38 |
| Zhisheng You | 2 | 417 | 52.22 |
| Zhengliang Li | 3 | 2 | 1.09 |