Description
A family of subsets is r-cover-free, if no set is covered by the union of r others. These families were introduced in coding theory by Kautz and Singleton (disjunctive codes, superimposed codes) in early sixties.<br/> Variants of these codes were later investigated by Erdos, Frankl and Furedi, Alon and Asodi, Szegedy and Vishvanathan, just to mention a few. These codes are useful in circuit complexity, mobile computing, in the theory of multiple access channels and many other branches of mathematics and computer science. Moreover, they led to the first counter-example for an old conjecture of Grunbaum on point sets in R^n without obtuse triangles.<br/> In this talk we will discuss old and new results on bounds of these codes and their relevance in computer science and pure mathematics.
Prochains exposés
-
Schéma de signature à clé publique : Frobénius-UOV
Orateur : Gilles Macario-Rat - Orange
L'exposé présente un schéma de signature à clé publique post-quantique inspiré du schéma UOV et introduisant un nouvel outil : les formes de Frobénius. L'accent est mis sur le rôle et les propriétés des formes de Frobénius dans ce nouveau schéma : la simplicité de description, la facilité de mise en oeuvre et le gain inédit sur les tailles de signature et de clé qui bat RSA-2048 au niveau de[…] -
Yoyo tricks with a BEANIE
Orateur : Xavier Bonnetain - Inria
TBD-
Cryptography
-
Symmetrical primitive
-