@InProceedings{benaroya_et_al:LIPIcs.CCC.2020.1,
author = {Ben-Aroya, Avraham and Doron, Dean and Ta-Shma, Amnon},
title = {{Near-Optimal Erasure List-Decodable Codes}},
booktitle = {35th Computational Complexity Conference (CCC 2020)},
pages = {1:1--1:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-156-6},
ISSN = {1868-8969},
year = {2020},
volume = {169},
editor = {Saraf, Shubhangi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.1},
URN = {urn:nbn:de:0030-drops-125531},
doi = {10.4230/LIPIcs.CCC.2020.1},
annote = {Keywords: Dispersers, Erasure codes, List decoding, Ramsey graphs, Two-source extractors}
}