Computing the minimum Hamming distance for large sets?

Is there an algorithm that's faster than brute force?

Checking ~2^(2*n-1) pairs for a set of size 2^n gets intractable
really quickly, and I can't find much in the way of references - they
all just say "Here this set of 16 code words, here's how you compute
hamming distance. To find the minimum, check all pairs."

-Austin
.

Relevant Pages

  • Re: ratio approximation algorithm
    ... I'm looking for an algorithm other than brute force that ... >> will speed up the searching process. ... I'd be surprised if Monte Carlo failed to suit your needs. ... a pure brute force approach took 0.37 seconds on my laptop (1.8GHz ...
    (comp.programming)
  • Re: Bonehead basic crypto question
    ... Even if 256-bit is broken by brute force using quantum computers ... as is secure should be used. ... People might like to say "even if an algorithm is ... be conservative) and focus on eliminating shortcut attacks. ...
    (sci.crypt)
  • Re: Combinatorics question
    ... It's an extension module for Python. ... bit manipulations popcount and Hamming Distance. ... Also does base two conversion which makes the mapping ... If you use MSA's corrected algorithm to generate 4-bit ...
    (sci.math)
  • Re: Searching substrings in records.
    ...     for each text field in the record ... but I just can't tell the difference between the algorithm ... you introduced above and the brute force approach I described on the ... every record and perform a substring search on any of them. ...
    (comp.programming)
  • Re: Combinatorics question
    ... It's an extension module for Python. ... bit manipulations popcount and Hamming Distance. ... Also does base two conversion which makes the mapping ... If you use MSA's corrected algorithm to generate 4-bit ...
    (sci.math)