Given C is a code of length n. Containing M code-words with a distance d
The distance of the code word is the minimum number of bit flips that transforms one codeword into another. It's just the minimum of all possible hamming distances between the codes.

Also you can define the weight of a codeword to be the distance from the zero vector.

For your code it looks like $d = 2$.