DIMACS Workshop on Codes and Association Schemes

November 9 - 12, 1999
DIMACS Center, Rutgers University, Piscataway, NJ

Organizers:

Alexander Barg, Bell Labs, Lucent Technologies, abarg@research.bell-labs.com

Simon Litsyn, Tel Aviv University, litsyn@eng.tau.ac.il

Program:

Tuesday, November 9

 8:15 -  8:55 	Breakfast and Registration

 8:55 -  9:00   Welcome and Greeting
                Fres S. Roberts, Director of DIMACS

 9:00 -  9:50   V.I. Levenshtein, Keldysh Inst. Appl. Math., Moscow
                Introduction: Codes and association schemes

10:00 - 10:30   E. Bannai, Kyushu University, Japan
                Some results on modular forms motivated by coding theory

10:30 - 11:00   P.-H. Zieschang, University of Kiel, Germany
                Groups + Buildings = Association Schemes

11:00 - 11:20   Coffee

11:20 - 11:50   W. Martin, University of Winnipeg, Canada
                From synchronization to integration:
                Linear programming bounds for RT codes and (T,M,S)-nets

11:50 - 12:20   J.H. van Lint, Eindhoven, the Netherlands
                On perfect ternary constant weight codes

12:30 -  2:00   Lunch

 2:00 -  2:30   L. Habsieger, University of Bordeaux, France
                On integral zeros of Krawtchouk polynomials

 2:30 -  3:00   U. Tamm, U.-Bielefeld, Germany
                Communication complexity and orthogonal polynomials

 3:00 -  3:30   G. Kabatiansky, IPPI, Moscow
                The Mastermind game,  the rigidity of Hamming
                spaces and superimposed codes

 3:30 -  4:00   Coffee

 4:00 -  4:30   S. Schmidt, MIT
                Moebius inversion in coding theory.

 4:30 -  5:00   D. Nogin, IPPI, Moscow
                Generalized Hamming weight as a weight function


Wednesday, November 10

 8:15 -  9:00   Breakfast and Registration

 9:00 -  9:50   A. Barg, Bell Labs, Lucent Technologies and IPPI, Moscow
                Polynomial method in coding theory

10:00 - 10:30   A. Samorodnitsky, IAS, Princeton
                On the optimum of Delsarte's linear program

10:30 - 11:00   T. Laihonen, University of Turku, Finland
                On An Algebraic Method for Bounding the Covering Radius

11:00 - 11:20   Coffee

11:20 - 11:50   V. Pless, University of Illinois, Chicago
                On the Classification of Extremal Additive Codes over GF(4)

11:50 - 12:20   L. Khachatrian, University of Bielefeld, Germany
                Maximal number of constant weight vertices of the unit
                n-cube contained in a k-dimensional subspace

12:30 -  2:00   Lunch

 2:00 -  2:30   N.J.A. Sloane, AT&T Shannon Lab, Florham Park
                Packings in Grassmannian spaces

 2:30 -  3:00   P. Boyvalenkov, Institute of Mathematics, Sofia, Bulgaria
                Linear programming bounds for spherical codes and designs

 3:00 -  3:30   T. Ericson, University of Linkoping, Sweden
                Distance regular spherical codes

 3:30 -  4:00   Coffee

 4:00 -  4:30   C. Bachoc, University of Bordeaux, France
                Harmonic weight enumerators

 4:30 -  5:00   M. Ruszinko, Hungarian Academly of Sciences, Budapest
                On superimposed codes


Thursday, November 11

 8:15 -  9:00   Breakfast and Registration

 9:00 -  9:50   M. Muzychuk, Bar-Ilan U., Israel
                Introduction to the theory of circulant
                association schemes and its applications.

10:00 - 10:30   P. Terwilliger, University of Wisconsin, Madison
                Association schemes with the Q-polynomial property

10:30 - 11:00   E. Egge, University of Wisconsin, Madison
                A generalization of the Terwilliger algebra
                of a commutative association scheme

11:00 - 11:20   Coffee

11:20 - 11:50   P. Camion, University Paris-VI, France
                Codes over Z_{p^n} and Association Schemes

11:50 - 12:20   J. Bierbrauer, Michigan Technological University
                Linear and additive codes: theory and applications
               

12:30 -  2:00   Lunch

 2:00 -  2:30   S.M. Dodunekov, Institute of Mathematics, Sofia, Bulgaria
                Bounds on the minimum block length of linear codes
                over finite fields

 2:30 -  3:00   V.I. Levenshtein, Keldysh Inst. Appl. Math, Moscow
                A general notion of a t-design and a universal bound on its size

 3:00 -  3:30   D. Jaffe, University of Nebraska, Lincoln
                Linear programming bounds for long codes

 3:30 -  4:00   Coffee

 4:00 -  4:30   S. Litsyn, Tel Aviv University, Israel
                Applications of the polynomial method to some combinatorial
                coding problems

 4:30 -  5:00   N. Sendrier, INRIA, Rocquencourt, France
                Structural attacks on code-based cryptosystems and related problems

 5:00 -  5:30   I. Dejter, DIMACS and the University of Puerto Rico
                Ternary perfect domination of binary cubes


Friday, November 12

 8:15 -  9:00   Breakfast and Registration

 9:00 -  9:50   E. Knill, Los Alamos National Lab.
                Classical and quantum codes as subsystems

10:00 - 10:30   A. Ashikhmin, Bell Labs, Lucent Technologies
                Quantum error detection

10:30 - 11:00   C. Carlet, INRIA and University of Caen, France
                Recent results on bent functions

11:00 - 11:20   Coffee

11:20 - 11:50   M. Grassl, University of Karlsruhe, Germany
                An ensemble of properties of classical codes useful
                for quantum codes

11:50 - 12:20   I. Chakravarti, U North Carolina, Chapel Hill
                Duality of hexads and hexagrams in a PG(2,4)
                and the configuration of 30 Baer subdesigns (7,4,2)
                in a (56,11,2) design

12:30 -  2:00   Lunch

 2:00 -  2:30   Z. Furedi, University of Illinois, Urbana-Champaign
                Lotto, footballpool and other covering radius problems

 2:30 -  3:00   T. Etzion, Technion, Haifa, Israel
                Tilings with generalized Lee spheres

 3:00 -  3:30   I. Honkala, University of Turku, Finland
                On identifying codes

 3:30 -  4:00   Coffee (end of workshop)

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage