Good locally testable codes (Alex LUBOTZKY, Weizmann Institute)

28.11.2024 13:30

An error-correcting code is locally testable (LTC) if there is a random tester that reads only a small number of bits of a given word and decides whether the word is in the code, or at least close to it. A long-standing problem asks if there exists such a code that also satisfies the golden standards of coding theory: constant rate and constant distance. Unlike the classical situation in coding theory, random codes are not LTC, so this problem is a challenge of a new kind.
We construct such codes based on what we call (Ramanujan) Left/Right Cayley square complexes. These objects seem to be of independent group-theoretic interest. The codes built on them are 2-dimensional versions of the expander codes constructed by Sipser and Spielman (1996).
The main result and lecture will be self-contained. But we hope also to explain how the seminal work of Howard Garland (1972) on the cohomology of quotients of the Bruhat–Tits buildings of p-adic Lie group has led to this construction (even though it is not used at the end).
Based on joint work with I. Dinur, S. Evra, R. Livne, and S. Mozes.


Le colloque sera suivi de thé/café à 14:30

Lieu

Bâtiment: Conseil Général 7-9

Salle 1-15, Colloque de mathématiques

entrée libre

Fichiers joints

LUBOTZKY_poster.pdf

246 Kb