Error Correcting Codes: What is Hamming Distance and Minimum Hamming Distance ?

No video

Error Correcting Codes: What is Hamming Distance and Minimum Hamming Distance ?

Рет қаралды 97,057

Күн бұрын

In this video, the basics of the Error Correction Codes and the Concept of Hamming Distance, and the Minimum Hamming Distance is Explained with examples.
Timestamps:
0:00 Error-Correcting Codes (ECC)
1:23 Repetition Code
3:18 Hamming Distance and Minimum Hamming Distance
Error Correcting Codes:
When the data is sent over the noisy channel then the Error-Correcting Codes are used for correcting the errors in received data bits.
The Error Correcting Codes are used in computer memories, in satellite communication, in one-way communication links, and in multicast systems.
The Repetition Code is the very basic type of Error-Correcting Code. In this video, the triple repetition code is explained and the issues of the repetition code are also explained.
What is Hamming Distance?
The Hamming Distance is the number of bit positions at which the two codes differ.
What is Minimum Hamming Distance?
It is the smallest Hamming Distance between all possible codes in the given encoding scheme.
The link for the other useful videos:
1) Error Detecting Code: Parity Explained | Odd Parity and Even Parity
• Error Detecting Code :...
2) Gray Code:
• Gray Code Explained | ...
This video will be helpful to all the students of science and engineering in understanding the concept of Hamming Distance and Minimum Hamming Distance.
#ALLABOUTELECTRONICS
#HammingDistance
Support the channel through membership program:
/ @allaboutelectronics
--------------------------------------------------------------------------------------------------
Follow my second channel:
/ @allaboutelectronics-quiz
Follow me on Facebook:
/ allaboutelecronics
Follow me on Instagram:
/ all_about.electronics
--------------------------------------------------------------------------------------------------
Music Credit: www.bensound.com

Пікірлер: 22

@ALLABOUTELECTRONICS 2 жыл бұрын

Timestamps: 0:00 Error-Correcting Codes (ECC) 1:23 Repetition Code 3:18 Hamming Distance and Minimum Hamming Distance

@shubhamkumarshaurya9326 2 жыл бұрын

how d+1 and 2d+1 formula came??

@ritampal01 2 жыл бұрын

Sir, you are really a great teacher. 👍 I'm so much interested on your digital electronics lectures. Happy teachers' day sir. 🙏

@cargames77778 2 жыл бұрын

Can you give whatsap number ?

@satya_kartik8795 2 жыл бұрын

Really great explanation brother. It helped me a lot to understand this hard concept. Thank you..

@poojashah6183 2 жыл бұрын

Happy teacher's day sir🎉🎊

@shadabzahra6274 2 жыл бұрын

Thanks man, the teacher in class didn't really explain it and I was so trying so hard to make myself understand but didn't succeed but then there I got your video.

@mayurshah9131 2 жыл бұрын

Very nice 👍👍

@freesciencelessons5100 4 ай бұрын

muchas gracias

@jirkadolezal8127 2 ай бұрын

thank you

@sanjayshah9838 2 жыл бұрын

Nice 👍👍👍 Vedio

@arnab94mallick 2 жыл бұрын

Very nice

@MohsinTahir-ej3oe 2 ай бұрын

Watching 6 hours before exams. respect from Pakistan

@gabrielrosso1577 Ай бұрын

obrigado❤

@yogeshraj8884 2 жыл бұрын

Please make a video on linear block code.

@meghanadas9359 Жыл бұрын

Can you make a video on Hsiao code?

@jinyuzhang8636 Жыл бұрын

For d bits of error detection, the minimum Hamming Distance is d + 1. I don't really understand it. Take the example from the video: 0000 0001 0010 0011 ... The minimum Hamming Distance is 1 since the number of different bits between 0000 and 0001 is 1. However, it is 5 (4 bit + 1)...did I miss something? Also, where did 2d + 1 is the minimum Hamming Distance for d bits of error correction come from?

@ALLABOUTELECTRONICS Жыл бұрын

For example, if you want to detect the 1 bit of error, then the coding scheme which you choose for the encoding, should have minimum hamming distance of 2 between the each possible codes. On the other hand, for the 1 bit error correction, the minimum hamming distance between the code after the coding should be equal to 3 ( 2d + 1). For example, if you use the 3 bit repetitive code for the encoding, then 1 is encoded 111 and 0 is encoded as 000. So, if you see the hamming distance between the code then it is 3. That's why these coding scheme can detect upto 2-bits of error and it can correct upto 1 bits of error in the encoded code at the receiver. I hope, it will clear your doubt.

@jinyuzhang8636 Жыл бұрын

@@ALLABOUTELECTRONICS Very helpful! Quite understand it now!