Johnson scheme

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, the Johnson scheme, named after Selmer M. Johnson, is also known as the triangular association scheme. It consists of the set of all binary vectors X of length and weight n, such that .[1][2][3] Two vectors xy ∈ X are called ith associates if dist(xy) = 2i for i = 0, 1, ..., n. The eigenvalues are given by


and Ek(x) is an Eberlein polynomial defined by


  1. ^ P. Delsarte and V. I. Levenshtein, “Association schemes and coding theory,“ IEEE Trans. Inform. Theory, vol. 44, no. 6, pp. 2477–2504, 1998.
  2. ^ P. Camion, "Codes and Association Schemes: Basic Properties of Association Schemes Relevant to Coding," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds., Elsevier, The Netherlands, 1998.
  3. ^ F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier, New York, 1978.