Search CORE

2 research outputs found

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

Author: C. Bazgan
M. Karpinski
W. F. Vega de la
W. F. Vega de la
W. Hoeffding
Publication venue: 'Springer Science and Business Media LLC'
Publication date
Field of study