Dense locally testable codes cannot have constant rate and distance.

Irit Dinur Tali Kaufman

Published in: Electron. Colloquium Comput. Complex. (2011)

Keyphrases

code length
point to point correspondences
distance measure
distance function
error correction
case study
euclidean distance
minimum distance
error correcting codes
optical flow fields
computational complexity
high dimensional
low complexity
sampling rate