Hypercubes


The TwoCube

The ThreeCube

The FourCube

Hamming Distance

Definition:
      Suppose we have an Alphabet A and strings S and T in A with length(S)=length(T) then H(S,T) = # of positions S[i]!=T[i]

Check:

  1. H(S,S) = 0
  2. H(S,T) = H(T,S)
  3. H(S,T) ≤ H(S,U)+H(U,T)
A={0,1}

In a Hypercube, nodes S and T have a direct connect if and only if H(S,T)=1