I've been reading about hash functions, but found nothing close to solve this problem - I'm looking for a function with could be used for binary comparison of multiple files / streams of bytes etc. Assume files:
- for file A we have
- for file B we have
- for file C we have
- for file D we have
- for file E we have
Now, goal is to find out which files have smallest - sorry if I misuse term here - "newtons distance". So basically, I would expect an algorithm that can state that for file A files B and E are "close" match.
Does such function exist, or one would need to use combination of several?
Sorry if I'm posting this on the wrong SE network. I could not decide if this belongs to Mathematics or Computational Science, better so decided to go for Cryptography. I'm pretty sure they'll create "StackAlgorithm" soon. :)
Or perhaps I'll elaborate.
Imagine we have 10k samples of various sizes. 1-10MB. Might be varied amplitude digital signals, might be un-normalized audio samples, I want to make it irrelevant. Goal is to keep database of such hashes to quickly select similar input, whether "shorter" or just partially different but same size.