Yes, it can correct only one bit error but can detect 2 bit errors with guarantee. The minimum hamming distance for 7,4 hamming code is dmin = 3. The “error detection” capability is dmin - 1 = 3-1=2 bit errors. The error correction capability is floor[(dmin-1)/2] = floor[(3-1)/2] = floor[1] =1
Multiply the information vector [1 1 1 1] with the generator matrix (shown at 3:30 of the video). This will give a codeword vector [1 1 1 1 1 1 1] as shown at 7:00 of video - the 16th entry in the table
Hats off. U taught very clear.😊🫡🫡🙌
Super clear, I appreciate it a lot.
Glad it helped!
thank you for the this great video, can you make more videos about digital modulation
Yes, soon
Thank you so much my brother
Always welcome
But the syndrome only allows correction of one bit error?
Yes, it can correct only one bit error but can detect 2 bit errors with guarantee. The minimum hamming distance for 7,4 hamming code is dmin = 3. The “error detection” capability is dmin - 1 = 3-1=2 bit errors. The error correction capability is floor[(dmin-1)/2] = floor[(3-1)/2] = floor[1] =1
how can i determine the transmitted codeword, in the information consisting of four ones using hamming (7,4)code?
Multiply the information vector [1 1 1 1] with the generator matrix (shown at 3:30 of the video). This will give a codeword vector [1 1 1 1 1 1 1] as shown at 7:00 of video - the 16th entry in the table