The Hamming Distance

http://adampanagos.org

The Hamming distance is a measure of distance between two codewords. We denote the distance between y and x as dH(y,x). The distance is easily computed as summation of the bit-wise modulo-2 sum. In other words, the Hamming distance between two vectors is just the number of bit positions where they differ.

The next video in this playlist is:
Block Decoding Minimum Distance Decoding Rule Derivation -    • Block Decoding Minimum Distance Decoding R...  

The previous video in this playlist is:
Block Coding Introduction -    • Block Coding Introduction  

Join the channel for membership perks:
   / @adampanagos  

Course website:
https://www.adampanagos.org/dc-digita...

If you enjoyed my videos please "Like", "Subscribe", and visit http://adampanagos.org to setup your member account to get access to downloadable slides, Matlab code, an exam archive with solutions, and exclusive members-only videos. Thanks for watching!