Wapproximability of dense instances of NEAREST CODEWORD problem

Cristina Bazgan; W. Fernandez de la Veg; Marek Karpinski

Conference Proceedings

Wapproximability of dense instances of NEAREST CODEWORD problem

Bazgan C
de la Veg W
Karpinski M

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2368 298-307

DOI: 10.1007/3-540-45471-3_31

2Citations

2Readers

Get full text

Abstract

We give a polynomial time approximation scheme (PTAS) for dense instances of the Nearest Codeword problem.

Cite

CITATION STYLE

APA

Bazgan, C., de la Veg, W. F., & Karpinski, M. (2002). Wapproximability of dense instances of NEAREST CODEWORD problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2368, pp. 298–307). Springer Verlag. https://doi.org/10.1007/3-540-45471-3_31

Wapproximability of dense instances of NEAREST CODEWORD problem

Abstract

Cite

Register to see more suggestions