<h2 id="heading-definition">Definition</h2>
<p>How many changes needed for two Strings or Bytes be same</p>
<h2 id="heading-example">Example</h2>
<h3 id="heading-hamming-distance-of-1011-and-0111-is-2">Hamming Distance of 1011 and 0111 is 2</h3>
<p>If you change 2 bits on 1011, it will be 0111.</p>
<p>1011 -&gt; 0011-&gt;0111</p>
<h3 id="heading-hamming-distance-of-acddf-and-bcdxy-is-3">Hamming Distance of acddf and bcdxy is 3</h3>
<p>If you change 3 characters on acddf , it will be bcdxy.</p>
<p>acddf -&gt;bcddf -&gt;bcdxf-&gt;bcdxy </p>
<h2 id="heading-usage">Usage</h2>
<ul>
<li>check error in computer science: server received same bits from client</li>
<li>quantum computing</li>
</ul>


## Definition
How many changes needed for two Strings or Bytes be same

## Example
### Hamming Distance of 1011 and 0111 is 2 

If you change 2 bits on 1011, it will be 0111.

1011 -> 0011->0111


### Hamming Distance of acddf and bcdxy is 3

If you change 3 characters on acddf , it will be bcdxy.

acddf ->bcddf ->bcdxf->bcdxy 


## Usage
- check error in computer science: server received same bits from client
- quantum computing


What is Hamming Distance

Definition

Example

Hamming Distance of 1011 and 0111 is 2

Hamming Distance of acddf and bcdxy is 3

Usage