Codes and Association Schemes

Keyphrases

Publications

volume 56, 2001

Codes and Association Schemes, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 9-12, 1999 Codes and Association Schemes 56 (2001)

1999

Ilia Krasikov, Simon Litsyn
Survey of binary Krawtchouk polynomials. Codes and Association Schemes (1999)
Preface. Codes and Association Schemes (1999)
Peter G. Boyvalenkov, Danyo Danev, Peter Kazakov
Indexes of spherical codes. Codes and Association Schemes (1999)
Laurent Habsieger
Integral zeroes of Krawtchouk polynomials. Codes and Association Schemes (1999)
Philippe Gaborit, W. Cary Huffman, Jon-Lark Kim, Vera Pless
(4) codes. Codes and Association Schemes (1999)
William J. Martin
Design systems: Combinatorial characterizations of Delsarte $\mathcal T$-designs via partially ordered sets. Codes and Association Schemes (1999)
Alexander Barg, David B. Jaffe
Numerical results on the asymptotic rate of binary codes. Codes and Association Schemes (1999)
Christine Bachoc
Harmonic weight enumerators of nonbinary codes and MacWilliams identities. Codes and Association Schemes (1999)
Claude Carlet, Philippe Guillot
Bent, resilient functions and the numerical normal form. Codes and Association Schemes (1999)
Tuvi Etzion
On perfect codes in the Johnson scheme. Codes and Association Schemes (1999)
Tero Laihonen
On an algebraic method for bounding the covering radius. Codes and Association Schemes (1999)
Foreword. Codes and Association Schemes (1999)
Tuvi Etzion, Jack H. van Lint
On perfect constant weight codes. Codes and Association Schemes (1999)
Ulrich Tamm
Communication complexity and orthogonal polynomials. Codes and Association Schemes (1999)
Jürgen Bierbrauer, Holger Schellwat
Weakly biased arrays, almost independent arrays and error-correcting codes. Codes and Association Schemes (1999)
Italo J. Dejter, Kevin T. Phelps
Ternary Hamming and binary perfect covering codes. Codes and Association Schemes (1999)
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
On identifying codes. Codes and Association Schemes (1999)
Ilia Krasikov
Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials. Codes and Association Schemes (1999)
Irfan Siap, Nuh Aydin, Dijen K. Ray-Chaudhuri
(5). Codes and Association Schemes (1999)
Iwan M. Duursma
A Riemann hypothesis analogue for self-dual codes. Codes and Association Schemes (1999)
Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn
Estimates of the distance distribution of nonbinary codes, with applications. Codes and Association Schemes (1999)
Mikhail E. Muzychuk, Mikhail H. Klin, Reinhard Pöschel
The isomorphism problem for circulant graphs via Schur ring theory. Codes and Association Schemes (1999)
Tatsuro Ito, Kenichiro Tanabe, Paul M. Terwilliger
-polynomial association schemes. Codes and Association Schemes (1999)
Paul Camion
and association schemes. Codes and Association Schemes (1999)