Example: bankruptcy

# 1 Hamming Distance - Ryerson University

De nition **1 (Hamming distance**) Given two vectors u;v 2Fnwe de ne the **hamming distance** between u and v, d(u;v), to be the number of places where u and v di er. Thus the **Hamming distance** between two vectors is the number of bits we must change to change one into the other. Example Find the **distance** between the vectors 01101010 and 11011011. 01101010

### Tags:

### Information

**Domain:**

**Source:**

**Link to this page:**