Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Monday, October 10, 2011, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Amir Shpilka (Technion)
A Locally Correctable Code (LCC) is an error correcting code that has a probabilistic self-correcting algorithm that, with high probability, can correct any coordinate of the codeword by looking at only a few other coordinates, even if a fraction \delta of the coordinates are corrupted. In this talk we will show interesting connections between LCCs and questions in additive combinatorics, combinatorial geometry over finite fields and rank of design matrices. In particular, we will prove tight lower bounds on the length of 2-query LCCs over finite fields. This is a joint work with Arnab Bhattacharyya, Zeev Dvir and Shubhangi Saraf.
Automatic MiSe System Software Version 1.4803M | admin login