BibTeX
@MISC{n.n._list-decodablecodes,
author = {n.n.},
title = { List-Decodable Codes},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The field of coding theory is motivated by the problem of communicating reliably over noisy channels — where the data sent over the channel may come out corrupted on the other end, but we nevertheless want the receiver to be able to correct the errors and recover the original message. There is a vast literature studying aspects of this problem from the perspectives of electrical engineering (communications and information theory), computer science (algorithms and complexity), and mathematics (combinatorics and algebra). In this survey, we are interested in codes as “pseudorandom objects. ” In particular, a generalization of the notion of an error-correcting code yields a framework that we will use to unify all of the main pseudorandom objects covered in this survey (averaging samplers, expander graphs, randomness extractors, list-decodable codes, pseudorandom generators).
