Lec-28: Single Bit Parity along With Hamming Distance Concept | Error Control

Single-bit parity is a simple error detection technique that involves adding an additional bit, called a parity bit, to a group of bits to detect errors in transmission or storage. The parity bit is calculated based on the number of 1s in the data bits.

0:00 - Introduction
6:33 - Hamming Distance

►Computer Networks (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Architecture:
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

#Singlebitparity #HammingDistance #GATE #UGCNET #PSU

[navaneeth_]

You are the reason for my A grades in my college computer networks, operating systems, digital logic courses...thanks a lot😉

[alishachhabra]

I really wished to have a teacher like you in my university but found it on youtube. I really appreciate your efforts in making us all understand each and every concept in such an easiest manner as well as in a short period of time. Thankss a lot Sir. You can't even imagine how precious your videos are for us.

[Manish_Sahu]

in this example minimum hamming distance is not 2, it 1 if you are not taking parity bit during xor and it is 3 if you are taking parity bit during xor.
one more thing it can detect all odd bit errors, as you said earlier, not only d-1 bit error

[anonymousgerman]

waheguruji ka khalsa waheguruji ki fateh guru maharaj chardikala ch rakhe ji
tusi bot changi tarike naal explain kardo ho dhanyavad

[exclusivefacts]

Every student's wish to have a lecturer like you sir, #passionate_lecturer

[kamalkishor]

Varun sir its my humble request please take a time to rearrange this series so that I, who doesn't have much knowledge in this domain, can easily learn it through your valuable videos ❤ 🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[Babu_chuna]

Best expaination skill ever i seen in my clg

[anmolsudan]

watching it on 1.75x Speed but still getting it. Amazing sir " Tussi na hundde te sadda ki hundda"

[athukutti]

U r good looking person with high talent in teaching awesome sir 😍😍

[AryanSharma-ze]

Sir minimum hamming distance 1 h
1st two case ko compare krenge tab 1 ayega
0000
0001
=1

[cookingshookingvlog]

Allah ap ko seht dy
Or ziyda kamiyab farmay
Ameen💓

[nagendradwivedi]

sir aapne itne boring subject ko bhi interesting bana diya H..apne Explanation se...well done sir..🧡🧡🔥🔥

[kokilagoel]

Happy Guru Poornima Dear Varun Sir #My Guru Ji🙏🙏🙏🙏🚩🚩🚩🚩☺️☺️

[killMan]

WOW simply no words for the itna bekaar kaise smjha te ho
💜

[komalsaleembhatti]

Thanks a lot Dear Sir! you are great and Stay blessed
Easiest way! wow

[ronakpatil]

Explanation is quite good and detailed👍👍

[sonybharti]

minimum hamming distance shoud be 1 for your given code word, when we perform xor operation for 0000 and 0001.

[satyamkumar]

Pls make test series on software engineering and Ur new look is awesome

[geetakotwani]

The Best and the most Informative Channel on Youtube..!!Keep up the Good Work..!!

[vickyprajapat]

Kaash aap mere college me lecturer hote... You are amazing sir!!