Jeudi 20 novembre 2008, à 14h30 en B567.
Stefan Dodunekov (Acad. Sc. Bulgarie).
Some optimization problems in Coding theory.
Transparents.

Problems about covering radius of codes, quasi-perfect codes, Singleton and Grey Rankin bounds will be considered. Some new results and open problems will be presented.