Kostka polynomial

From formulasearchengine
Revision as of 17:03, 8 April 2013 by en>Funnyfarmofdoom (Reverted edits by 98.155.202.28 (talk) to last revision by AnomieBOT (HG))
Jump to navigation Jump to 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 v=|X|=(n).[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

pi(k)=Ei(k),
qk(i)=μkviEi(k),

where

μi=2i+1i+1(i),

and Ek(x) is an Eberlein polynomial defined by

Ek(x)=j=0k(1)j(xj)(nxkj)(nxkj),k=0,,n.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  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.