Login / Signup

A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem.

Per AustrinSubhash Khot
Published in: ICALP (1) (2011)
Keyphrases
  • minimum distance
  • upper bound
  • error correcting codes
  • distance measurement
  • convex polyhedra
  • data sets
  • optimal solution
  • video sequences
  • color images
  • knn
  • nearest neighbor
  • source code
  • linear programming