hamming distance

(idea) by artemis entreri Fri Dec 29 2000 at 1:45:59
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.
del.icio.us Furl Facebook Digg StumbleUpon Reddit   (I like it!)
Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.