6 search results - page 2 / 2 » Bounds for binary codes relative to pseudo-distances of k po... |
APPROX
2009
Springer
14 years 10 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...