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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, January 05, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Bernhard Haeupler (Carnegie Mellon University)

Synchronization Strings: Optimal Coding for Insertions and Deletions

We introduce synchronization strings, which provide a novel way of efficiently dealing with insdel errors, i.e, insertions and deletions in communications. Insdel errors are strictly more general, much harder, and significantly less well understood than symbol corruptions. Synchronization strings can transform insdel errors to these more benign corruptions, essentially without overhead. This has many applications. One important example is a simple black-box construction which transforms any (large alphabet) error correcting code into one that can correct insdel errors as well. This leads to optimal insdel error correcting codes which drastically improve upon the state of the art. This is joint work with Amirbehshad Shahrasbi.

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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