@InProceedings{blanc_et_al:LIPIcs.CCC.2022.10,
author = {Blanc, Guy and Doron, Dean},
title = {{New Near-Linear Time Decodable Codes Closer to the GV Bound}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {10:1--10:40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.10},
URN = {urn:nbn:de:0030-drops-165726},
doi = {10.4230/LIPIcs.CCC.2022.10},
annote = {Keywords: Unique decoding, list decoding, the Gilbert-Varshamov bound, small-bias sample spaces, hypergraphs, expander walks}
}