Minimum Hamming Distance - Error Detection | dmin = s+1 | Data Communications Lecture

Channel:
Bangladesh EduTraGam
Subscribers:
3,030
Published on ● Video Link: https://www.youtube.com/watch?v=UntZc9UCrZY


Duration: 13:44
281 views
0

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.



Other Videos By EduTraGam


2020-05-06Project Management: Project Crashing Example | Project Acceleration Example | How to Crash - Part#2
2020-05-06Project Management: Project Crashing Example | Project Acceleration Example | How to Crash - Part#1
2020-05-06Project Management: Steps/Implementation of Project Crashing/Project Acceleration (Bangla)
2020-05-05Project Management: Project Crashing | Project Acceleration and Project Overhead (Bangla)
2020-05-04Earned Value Analysis in Project Management - Worked Out Example| Earned Value Analysis Example |EVA
2020-05-04Earned Value Analysis|Project's Progress Evaluation and Forecasting in Project Management|EVA|PMP
2020-04-05Even Parity-Check Code | C(5,4) Even Parity-Check Code to Detect Odd Number of Errors - Example
2020-04-05Parity | Parity-Check Code | Parity Bit | Encoding and Decoding for Parity-Check Code - Example
2020-04-02Linear Block Code | Minimum Hamming Distance in Linear Block Code | Data Communications Lecture
2020-04-02Minimum Hamming Distance - Error Detection - Worked Out Example | Data Communications Lecture
2020-04-02Minimum Hamming Distance - Error Detection | dmin = s+1 | Data Communications Lecture
2020-04-02Minimum Hamming Distance | Calculation of Minimum Hamming Distance |Minimum Hamming Distance Example
2020-04-01Hamming Distance | What is Hamming Distance | Explanation | Example (Bangla)
2020-03-31Waterfall Model | Classic Life Cycle/Linear Sequential Model | Iterative Waterfall Model | V-Model
2020-03-29Redundancy | Block Coding | Redundancy & Block Coding in Communication | Data Communications Lecture
2020-03-29Errors | Types of Errors | Error Detection & Error Correction | Error Detection vs. Error Correction
2020-03-28Introduction to Software Process Models | Process Flow - Linear, Evolutionary, Iterative & Parallel
2020-03-28Coin Change Problem | Coin Change Problem using Dynamic Programming | Worked Out Example Explained
2020-03-28Coin Change Problem | Problem Statement | Example with Explanation


Tags:
Minimum Hamming Distance in Error Detection
MHD in Error Detection
d-min = s + 1
d-min is greater than s
Geometric representation of Minimum Hamming Distance
If we want to detect up to s errors then Minimum Hamming Distance is s+1
Relation between Minimum Hamming Distance and no. of errrors
Relation between d-min and s
Explanation
CSE
Bangla
Minimum Hamming Distance
Data Communication
Communication theory
Communication
Telecommunication
Error Detection and Correction