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
-
Adelic reduction of module lattices
Orateur : Henry Bambury - DGA-MI et Inria Rennes
We give a strict generalisation of the LLL algorithm over number fields, based on the reduction theory of $GL(n)$ over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity. -- based on joint work with Seungki Kim, Changmin Lee and Phong Nguyen ---
Cryptography
-
-
European Cyber Week: atelier cryptographie post-quantique
Dans la continuité des éditions 2021, 2022 et 2024, la DGA — en partenariat avec CREACH LABS et avec le soutien de l'ANSSI, de l'IRISA, de l'IRMAR et du Pôle d'Excellence Cyber — organise la 4e édition de l'atelier consacré à la cryptographie post-quantique dans le cadre de l'European Cyber Week 2026. Attention, il faut s'inscrire (gratuitement) au préalable — s'inscrire à la conférence Les[…] -
Post-quantum day of the cryptography seminar
A scientific day devoted to post-quantum cryptography, held in the wake of the European Cyber Week, with talks more technical than those presented at the ECW.