Orthogonal array
In mathematics, in the area of combinatorial designs, an orthogonal array is a "table" (array) whose entries come from a fixed finite set of symbols (typically, {1,2,...,n}), arranged in such a way that there is an integer t so that for every selection of t columns of the table, all ordered t-tuples of the symbols, formed by taking the entries in each row restricted to these columns, appear the same number of times. The number t is called the strength of the orthogonal array. Here is a simple example of an orthogonal array with symbol set {1,2} and strength 2:
Orthogonal array
In mathematics, in the area of combinatorial designs, an orthogonal array is a "table" (array) whose entries come from a fixed finite set of symbols (typically, {1,2,...,n}), arranged in such a way that there is an integer t so that for every selection of t columns of the table, all ordered t-tuples of the symbols, formed by taking the entries in each row restricted to these columns, appear the same number of times. The number t is called the strength of the orthogonal array. Here is a simple example of an orthogonal array with symbol set {1,2} and strength 2:
has abstract
In mathematics, in the area of ...... ous types of software testing.
@en
Link from a Wikipage to an external page
Wikipage page ID
17,887,653
Wikipage revision ID
740,651,629
hypernym
type
comment
In mathematics, in the area of ...... mbol set {1,2} and strength 2:
@en
label
Orthogonal array
@en