hamming distance (idea)

A term in combinatorics.  In a binary code a distance can be defined between code words,
given two words v and w the Hamming distance, d(v,w) is the number of positions in which
they differ.

    For instance:

                    0100110110111 and
                    0010110110111

    are at Hamming distance 2 from one another.