Some distribution numbers of the hypercubic association scheme (Q1103622)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some distribution numbers of the hypercubic association scheme
scientific article

    Statements

    Some distribution numbers of the hypercubic association scheme (English)
    0 references
    0 references
    1988
    0 references
    [See also the preceding and the following review.] In this paper the author calculates a lot of distribution numbers of the Hamming (association) scheme. First he gives some trivial bounds, and using the existence of Orthogonal Arrays shows that these bounds are sometimes sharp. Then he computes \(vt_ 1(H(n,q))\) for all n and q. Under some extra assumptions he can sharpen the trivial bounds somewhat. By relating the distribution numbers of H(n,q) to those of H(n-1,q), he is able to show that \(vt_{\{1,2\}}(H(n,q))<q^{n-2}\cdot (n\geq q+2)\). The paper ends with some remarks on the cases \(n=3\) and \(q=2\) and a table of distribution numbers for H(4,2).
    0 references
    association schemes
    0 references
    Hamming schemes
    0 references
    distribution numbers
    0 references
    Orthogonal Arrays
    0 references

    Identifiers