Hamming Code - How To Find Corrupted Bit - Even Parity

have a test today and this video helped a lot....

Thank you...i appreciate yr effort for this

thatnk so much dude !! life saver the night before the exam

Bro in the P4 bit , why didn't you start with the question mark , you put the 0 from the 4th bit as it is from the binary code

Thank you

i cane here to learn but your voice is so addictive

What if the wrong bit is in a parity position, let's say 4th position? What is the original pre-Hamming code data transmitted then?

Simple but effective

helped me a lot. thnx =)

u failed in the last example at p8 it must be 1110 as i think and as u solved the first one

some people starts the counting from the least significant bit while you do it from most significant bit, won't it affect the answer? and if so, which one is the more correct?

This guy just saved me a couple hours of research!!

Thank you very Much, sir 🤘✨✨✨✨
It really helped me a lot to get my question's answer ^_^
Clear explanation 👍✨

came across few video on similar problems. but i could only finally catch up with this one. Thanks!

I have wasted 2 hours to solve a question then i found your video and solved the question in just 1 minute
Thanks 👍👍

Thank you so much. Wish you the best.

awh. finally someone who speaks human language!

Easiest Explanation ever

You are the best!

would this work the same for odd parity?

Well explanation, you made it much clear now, but shouldn't we write down P values with the data bits as well? you did so with P4 but doesn't the same principle hold for the rest of the P values too?

Clear, concise presentation and delivery. Everything I ever wanted from an educational video. Thank you :)

THANK YOU SO MUCHHH

I did not understand when my teacher explained but this video made so much sense!

this is decoding right?

Finally understood it thanks man!

One Question, what do I do if there is more than 1 Corrupted bit?

I didn't understand the part where you check and skip parts.why at the P8 we skipped the 8 beats instead of checking them first ?

thank you so much. amazing teaching

dude , u are unmatched istg , are u kidding me ?! in 4minuts i got it . i love you .

Sophisticated made simple. 👑

Very good ❤❤❤

I have a question: Will this method be used for odd parity as well? Please reply anyone I have paper tomorrow

Sir we want formula
for parity(p8)

Love you, you saved me

best explanation

Amazing

BRO YOU RE SO GOOD AT EXPLAINING THINGS <3

Does this also work with less bits (8 bits for example)

love u bro watched this last night very simple
🥰🥰

Thanks

thanks my guy much simpler method

Great full sir 😢

Why did you add a question mark? In every material I read you still count the parity bit

this is worldclass

you are my superhero, been staring at my question for over 2 says wondering how they decided that the 7th bit is the corrupted one, thank you

Ham

nah bro you cooked