Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Monday, October 10, 2011, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Amir Shpilka (Technion)

Tight lower bounds for 2-query LCCs over finite fields

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login