DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 2001; 303 pp; hardcover Volume: 56 ISBN10: 0821820745 ISBN13: 9780821820742 List Price: US$109 Member Price: US$87.20 Order Code: DIMACS/56
 This volume presents papers related to the DIMACS workshop, "Codes and Association Schemes". The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results for codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics. Papers on coding theory are related to classical topics, such as perfect codes, bounds on codes, codes and combinatorial arrays, weight enumerators, and spherical designs. Papers on orthogonal polynomials provide new results on zeros and symptotic properties of standard families of polynomials encountered in coding theory. The theme of association schemes is represented by new classification results and new classes of schemes related to posets. This volume collects uptodate applications of the theory of association schemes to coding and presents new properties of both polynomial and general association schemes. It offers a solid representation of results in problems in areas of current interest. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students and research mathematicians interested in coding theory, algebraic combinatorics, and computer science. Table of Contents  C. Bachoc  Harmonic weight enumerators of nonbinary codes and MacWilliams identities
 A. Barg and D. B. Jaffe  Numerical results on the asymptotic rate of binary codes
 J. Bierbrauer and H. Schellwat  Weakly biased arrays, almost independent arrays and errorcorrecting codes
 P. Boyvalenkov, D. Danev, and P. Kazakov  Indexes of spherical codes
 P. Camion  Codes over \(\mathbb Z_{p^n}\) and association schemes
 C. Carlet and P. Guillot  Bent, resilient functions and the numerical normal form
 G. D. Cohen, I. Honkala, A. Lobstein, and G. Zémor  On identifying codes
 I. J. Dejter and K. T. Phelps  Ternary Hamming and binary perfect covering codes
 I. Duursma  A Riemann hypothesis analogue for selfdual codes
 T. Etzion  On perfect codes in the Johnson scheme
 T. Etzion and J. van Lint  On perfect constant weight codes
 P. Gaborit, W. C. Huffman, J.L. Kim, and V. Pless  On additive \(GF(4)\) codes
 L. Habsieger  Integral zeroes of Krawtchouk polynomials
 T. Ito, K. Tanabe, and P. Terwilliger  Some algebra related to \(P\) and \(Q\)polynomial association schemes
 I. Krasikov  Bounds for the ChristoffelDarboux kernel of the binary Krawtchouk polynomials
 I. Krasikov and S. Litsyn  Survey of binary Krawtchouk polynomials
 T. Laihonen  On an algebraic method for bounding the covering radius
 W. J. Martin  Design systems: Combinatorial characterizations of Delsarte \(\mathcal T\)designs via partially ordered sets
 M. Muzychuk, M. Klin, and R. Pöschel  The isomorphism problem for circulant graphs via Schur ring theory
 I. Siap, N. Aydin, and D. RayChaudhuri  New 1generator quasitwisted codes over GF(5)
 U. Tamm  Communication complexity and orthogonal polynomials
 A. Ashikhmin, A. Barg, and S. Litsyn  Estimates of the distance distribution of nonbinary codes, with applications
