Thank you so much! If only my university professors where this good at explaining stuff...

Thank you, great video as always

Brother I love you so much. You are king for explaining how to calculate these c1 c2 c3 c4 correction bits. I love you

thank you for this Awesome material.

Lovely explanation

Wonderful explanation!!

My 4 years of university is wasted. I'd rather stay home and watch KZfaq in my next life.

I am grateful to you...

great video! thanks!

is it a same principle for 5 bites binary code or is there some diferent type of protecting code?

You know you are a wonderful person , Thank you really 😍 ...

Thank you so much ❤

Thank you

Thank you SO Much sirr!!!

Awesome!

Great video. You just denoted the hamming code representation the other way round the p1 bit is supposed to be the rightmost and vica versa. If that is not taken care of while solving a question one may declare a valid hamming code to be invalid!!!! So be careful and if possible write a note about it in the video.

How many of you came here after similar video in gate smashers?

Sir please complete the series of python programming language

awesome

No one can match the previous guy who took this topic 🙂

halo everyone and welcome back

very confusing example you have taken but you explained the concept nicely.

what is the most significant figure? 0110 is a poor example. is it right to left or left to right?

Is this correct ? Position named from right to left

❤❤❤❤❤

what if we want to transmit a message with 9 bits. How many c1,c2,c3... we will have ?

You suddenly become foreigner and suddenly south indian 😂 (voice)

🎯 Key Takeaways for quick navigation: Hamming code is capable of facilitating error detection and correction, unlike simple binary codes. In computer organizations, single bit errors are common, and Hamming code helps correct them. Parity bits are appended to the message for error correction. Two scenarios can occur: no corruption or one bit is corrupted. To handle errors, Hamming code requires 2^p patterns, where p is the number of parity bits, and 2^p >= p + M + 1, where M is the data size. Example: For 4 bits of data, 3 parity bits are needed. Parity bits are placed strategically to judge specific sets of data bits for errors. The receiver uses parity bits to determine which bit is corrupted and correct it. Hamming code allows for single bit error correction by pinpointing and correcting the erroneous bit. Made with HARPA AI

Why are there only 3 c bits? What is transmitted? This is confusing