On the nonbinary Johnson scheme
Johnson's scheme in coding theory is a symmetric association scheme over a binary set. Dunkl (1976) derived a symmetric association scheme over a nonbinary finite set making use of a wreath product of two symmetric groups. Dunkl also found a representative set of simple modules over this wreath product and hence obtained the eigenvalues of the scheme. This paper gives an interesting alternative approach and presents a derivation for the eigenvalues of the nonbinary Johnson scheme by using elementary combinatorial methods.
scientific article; zbMATH DE number 3924677