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, May 06, 2021, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Saeed Ilchi

On List Decoding of Reed-Solomon Codes

A code over alphabet Σ and with block length n is (ρ,L)-list decodable if any hamming ball of radius ρn in Σn contains at most L codewords. We are interested in maximum ρ where the code is (ρ,L=poly(n))-list decodable.

For Reed-Solomon codes with arbitrary evaluation points, we cannot expect a rate significantly better than ε2 to list decode up to radius 1-ε. This indeed matches the Johnson bound. Although, it has shown that if we take an RS-code with random evaluation points, the rate becomes Õ(ε). Moreover, the list size is constant, say O(1/ε). We will discuss this result based on the works of Shangguan, and Tamo (, and Guo, Li, Shangguan, Tamo, and Wootters (

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

Previous talks by year:   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