i am having a hard time understanding the concept of hamming distance. i have watched many videos on youtube which shows how to find hamming distance between two codewords. But how can i find the hamming distance of this example in the book ?How it comes to 3 ?
kindly someone explain
Thanks Peter.
but can you explain the example in the snapshot. its from tanenbaum book. i know the definition of hamming distance. in this example which other codeword is he comparing with ?
hamming code can use for error correct mechanism. It can set with redundancy bit with data bit.
r1 : bits 1, 3, 5, 7, 9, 11
r2 : bits 2, 3, 6, 7, 10, 11
r4 : bits 4, 5, 6, 7
r8 : bits 8, 9, 10, 11
check the attachment ,example error correction is noted
Please follow the Book "Data Communication and Networking". You can find the all the necessary examples of hamming distance calculation and it's relevant applications with the most easiest way.
Download the book :
http://iit.qau.edu.pk/books/Data%20Communications%20and%20Networking%20By%20Behrouz%20A.Forouzan.pdf
- Badges
- Science topic