@InProceedings{alon_et_al:DagSemProc.09421.4,
author = {Alon, Noga and Panigrahy, Rina and Yekhanin, Sergey},
title = {{Deterministic approximation algorithms for the nearest codeword problem}},
booktitle = {Algebraic Methods in Computational Complexity},
pages = {1--13},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {9421},
editor = {Manindra Agrawal and Lance Fortnow and Thomas Thierauf and Christopher Umans},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09421.4},
URN = {urn:nbn:de:0030-drops-24133},
doi = {10.4230/DagSemProc.09421.4},
annote = {Keywords: }
}