@InProceedings{jeronimo:LIPIcs.APPROX/RANDOM.2023.60,
author = {Jeronimo, Fernando Granha},
title = {{Fast Decoding of Explicit Almost Optimal \epsilon-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {60:1--60:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.60},
URN = {urn:nbn:de:0030-drops-188858},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.60},
annote = {Keywords: Decoding, Approximation, GV bound, CSPs, HDXs, Regularity}
}