Minimum Hamming Distance - Error Detection | dmin = s+1 | Data Communications Lecture
286 بار بازدید -
4 سال پیش
-
In this tutorial, I have
In this tutorial, I have explained in Bangla the significance of Minimum Hamming Distance (MHD) in Error Detection by putting a great focus on the relationship between Minimum Hamming Distance and no. of errors to which we want to successfully detect the occurrence of error.
"If we want to successfully detect up to s errors then the minimum value of hamming distance in a set of code-words should be greater than s by 1 and that is d-min = s + 1" - the geometric representation of this fact has also been demonstrated here.
I have followed Page-261 & 262, Chapter 10: Error Detection and Correction from the book - Data Communications and Network, 5th Edition by Behrouz A. Forouzan.
"If we want to successfully detect up to s errors then the minimum value of hamming distance in a set of code-words should be greater than s by 1 and that is d-min = s + 1" - the geometric representation of this fact has also been demonstrated here.
I have followed Page-261 & 262, Chapter 10: Error Detection and Correction from the book - Data Communications and Network, 5th Edition by Behrouz A. Forouzan.
4 سال پیش
در تاریخ 1399/01/14 منتشر شده
است.
286
بـار بازدید شده