Deterministic Approximation Algorithms for the Nearest Codeword Problem

Noga Alon, Rina Panigrahy, Sergey Yekhanin. Deterministic Approximation Algorithms for the Nearest Codeword Problem. In Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings. Volume 5687 of Lecture Notes in Computer Science, pages 339-351, Springer, 2009. [doi]

No reviews for this publication, yet.