Course Description

A day about the Delsarte bound

Monday October 29, 2007 (9:00 - 18:00).

A scientific fest in honor of Philippe Delsarte, emeritus

A question : let us imagine a lot of balls with the same radius. What is the best configuration of such balls when you want to pack it at best ? The discussion began with Newton, Gregory, Kepler, and many other ones. The question seems naive but it is strongly related to information theory (Shannon), combinatorics, quantum communication, error-correcting codes, energy, puzzles, ... It is the so-called kissing problem (for balls).

Philippe Delsarte gave us close bounds on the number of balls using linear programming...

Our invitation to an exclusive day with many living experts in the world.

Venue

Université catholique de Louvain
Place de l'Université, 1
Sénat Académique
B-1348 Louvain-la-Neuve Belgium

See how to get to Louvain-la-Neuve.

Talks

• Christine Bachoc (Bordeaux)
  Generalizations of P. Delsarte linear programming bound in the framework of group representation
• Robert Calderbank (Princeton)
• Henry Cohn (Microsoft Research)
• Michel Goemans (MIT)
• Abhinav Kumar (Harvard)
  Linear programming bounds for potential energy and universally optimal configurations
• Alex Samorodnitsky (Hebrew University of Jerusalem)
  What makes the linear programming bounds for codes so good ?
• Alexander Schrijver (CWI)
  Delsarte Triple and Semidefinite

A reception will be organized after the talks.

Organization

The event is sponsored and organized by the following UCL partners :

• INGI department (Computer Science department),
• Graduate school in Systems, Optimization, Control and Networks (SOCN),
• Graduate school on MUltimedia, SIlicon, Communications, Security Electrical and Electronics Engineering (MUSICS),
• PAI DYSCO (INMA),
• PAI BCRYPT (TELE),
• UCL Crypto Group.

More information:

Jean-Jacques Quisquater, Olivier Pereira.

Registration

Registration is free but mandatory. Please register as soon as possible.