Codes and association schemes : DIMACS Workshop Codes and Association Schemes, November 9-12, 1999, DIMACS Center

Includes bibliography (p. 301-303) and references.

1 Harmonic weight enumerators of nonbinary codes and MacWilliams identities
2 Numerical results on the asymptotic rate of binary codes
3 Weakly biased arrays, almost independent arrays and error-correcting codes
4 Indexes of spherical codes
5 Codes over Z[subscript p]n and association schemes
6 Bent, resilient functions and the numerical normal form
7 On identifying codes
8 Ternary Hamming and binary perfect covering codes
9 A Riemann hypothesis analogue for self-dual codes
10 On perfect codes in the Johnson scheme
11 On perfect constant weight codes
12 On additive GF(4) codes
13 Integral zeroes of Krawtchouk polynomials
14 Some algebra related to P- and Q-polynomial association schemes
15 Terwilliger. Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials
16 Survey of binary Krawtchouk polynomials
17 On an algebraic method for bounding the covering radius
18 Design systems: combinatorial characterizations of Delsarte T-designs via partially ordered sets
19 The isomorphism problem for circulant graphs via Schur ring theory
20 Poschel New 1-generator quasi-twisted codes over GF(5)
21 Communication complexity and orthogonal polynomials
22 Estimates of the distance distribution of nonbinary codes, with applications

Presents papers related to the DIMACS workshop, 'Codes and Association Schemes'. This title includes articles such topics as: applications of association schemes and of the polynomial method to properties of codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics.