Methods of Discrete MathematicsStefan Löwe |
Contents
An Introduction to Association Schemes | 3 |
Delsartes theory of codes and designs in association schemes 27 | 27 |
Spherical codes and designs 35 | 35 |
Copyright | |
6 other sections not shown
Common terms and phrases
a₁ affine Algebraic Combinatorics Askey-Wilson polynomials B₁ Bannai bilinear form Blokhuis Bose-Mesner algebra called character table classification problem codeword coding theory coefficient commutative association schemes consider defined Delsarte denote distance regular graphs divisor elements examples Exercise finite field finite simple groups form of weight fully reducible Geometry GF(q GF(q² group association schemes group G hence Hilbert modular forms integers integral lattice intersection Johnson association scheme k₁ lacunary polynomials linear code Math matrix maximal arcs Moore graph N. J. A. Sloane nuclei number field Open Problem orthogonal polynomials P-and Q-polynomial association parameters permutation group polynomial of degree primitive idempotents proof Prove Q-polynomial association schemes R₁ scheme J(v scheme of class self-dual code sphere spin models strongly regular graphs subset symmetric association scheme t-fold Theorem theta function transitive permutation group unimodular lattice vector weight enumerator zero