Approximability of dense instances of NEAREST CODEWORD problem

DOI10.1007/3-540-45471-3_31MaRDI QIDQ3046504zbMATH OpenOpenAlexFDO

Authors Cristina Bazgan, W. Fernandez de la Vega, Marek Karpinski

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45471-3_31

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cited in

(1)

• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

This page was built for publication: Approximability of dense instances of NEAREST CODEWORD problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046504)