Error Detection and Correction 2: Cyclic Redundancy Check

The Cyclic Redundancy Check is another form of error detection that involves use of modulo 2 arithmetic to compute a Frame Check Sequence that is added on to the end of a transmitted frame in order to verify correct transmission. Much of this material is based on content from the book Data and Computer Communications by William Stallings.

[@TheSulaimanKhaled]

You are the only one who actually made me understand what is going on between all the videos on youtube. Thank you so much and god bless you

[@FreeDomSy-nk9ue]

Literally

[@goedeck1]

Yeah

[@aphelmusonda5253]

The statement ".....made me understand What is going on between all the videos on KZbin"😂😂😂😂sounds funny, seems you were very lost and bumped into this informative tutorial😂

[@DoctorUltraviolence]

Just the first two minutes made me grasp this whole concept better than 30 mins of reading my course book.

[@Sirstep]

By far, the most comprehensive and clear explanation I've seen on this subject. I really appreciate your help!

[@jnskender]

Stop here if your looking for the definitive explanation of CRC calculations.

[@bubkabu]

This is the only good CRC Explanation video on youtube. thank you!

[@isaiahhiggins]

I missed this lecture and was totally clueless when we had to manually calculate a frame check sequence. This is exactly what I needed, and probably explained more clearly than the professor too! Thank you

[@jessesgamereviewstipsandst5517]

Very clear and concise explanation. Thanks for explaining how zeroes on the left side doesn't count for the length when trying to divide, it was the confusing part that other video didn't explain so watching this video clarified it.

[@tcaotuesday2358]

As a not native English Speaker, I really can not understand other videos with indian accent, your video is really helpful, thanks :)

[@felixreibold8891]

I agree with the other commenters, this is the best video explaining CRC, it took me 4 other videos to land here, youtube is really getting clutteed thers days. Push it to the top guys!!

[@ilyashitchens649]

I struggled to find a video which gives a clear explaination of the concept. thank you and well done ! 👌👌👌

[@hellocony3727]

This is it! I can't believe there is no simple explanation online to this basic concept. Great job!

[@kitkat224]

Thank you Jacob! This is the only video you need to watch to understand CRC

[@TheWarleader]

with online school being the norm because of self quarantine, this video has helped a TREMENDOUS amount as it's hard to get in touch with my professors for a clear cut explanation. Thank you so much!!

[@AO-hk7dj]

Thank you so much, I have watched over ten youtube videos and this is the only one where everything is perfectly explained, so grateful

[@ugochukwuifeacho3916]

Great video Jacob. This is the best video so far on CRC here on KZbin

[@kelvinmutale5370]

Wow! this the best explanation I've come across on KZbin, hope you can do the polynomial division as well.

[@bdig7]

Thanks so much mate, you are literally the only person in the world explaining this!

[@talalalkharashi1951]

best explanation ive seen on youtube for CRC thanks!

[@whatshisname1653]

i love you.. finally a clear, concise explanation

[@ricp]

Man.., this is an Excellent explanation!, really, not one extra word. You covered all the doubts I had, thanks so much!

[@ramitchatterjee9626]

your explanation was very good, stream lined and filled with useful informations to understand the method well. Thanks

[@sameerislam1999]

Best CRC tutorial i have found. thank you

[@goldenstatecamping]

Unreal how easy you made this. Thanks man!

[@stanley9571]

Thank you very much!!!! You have no idea of how much help you have been!

[@aungthihasoe2580]

Now I finally understand how to do CRC properly after watching your video. Thank you very much Sir.

[@BlackHermit]

Great explanations, thank you so much! Greetings from Sweden!

[@plastilinovbly]

This is the best video on the topic, thank you! I finally understood it:)

[@HP-fj2mi]

Thank you very much Jacob. I agree with the rest of the comments. You explained in a clear and easy way that I could understand it. This is going to help with CIS class. Great job!

[@filippomike8213]

Thank you for your clear explanation! I have a dumb question how do you make sure that both the receiver and the sender know the CRC pattern? because if you send that too it might get affected from errors no? Thank you a lot in advance!

[@nojoodothmanal-ghamdi1026]

Thank you sooo much you explained the physics behind it and gave us a step-by-step example while explaining each step! I understood it thanks to you sir

[@TNH91]

Thanks for a great video on how to manually do the CRC. My book ( Kurose & Ross ) does not explain it a fraction as well as you did. This helped me understand the use of the Generator and Data and how they interacted.

[@stellaraja02]

The explanations are so clear . Really appreciate it!!

[@daniellino6126]

Thank you so much, hope I can use this on the exam I have tomorrow!

[@125dudeman]

This video is amazing. Professor rambled about this for days, this 12 min video taught me infinitely more... KZbin and @Jacob Schrum >>>

[@Vekktone]

thank god for this video. I am confident I will get this problem right on my networks final tomorrow!! Thank you so much for making this clear!!!

[@_Anna_Nass_]

best explanation I could find, thank you!!!

[@juantelle1]

Thanks. My exam is tomorrow. You have saved me.

[@yazeedazrai5036]

very clear way better than both the prof and the slides

[@scanpower8439]

THANK YOU SO MUCH! You made it easy to understand!!!

[@FitzRave]

Now this is what I call a great explanation!

[@Nihilish]

Out of curiosity, why do we write down those bits on top if we don't even use them in the algorithm?

[@nikolassj]

Huge help, thank you a lot Jacob! I wish that the professors on my Uni were so good at explaining things....

[@zigggy345]

Wonderfully explained, many thanks!

[@zakylib]

Thank you. Thank you. Thank you. Evrythign just makes sense now.

[@schnackenpfefferhausen]

Extremely helpful and clear. Thank you!

[@bobbyjack4368]

best explanation on youtube

[@mahmoudelsheemy4235]

Great Explanation. Thank You!

[@ccristi08]

Very well explained. Kudos to you sir.

[@gingsSon]

Perfect explanation. Thank you.

[@MohamedIbrahim-sj1td]

great video!! Can you explain how the receiver can correct the error when the remainder doesn't come out Zero?

[@parthikirubha]

I am also having the same question

[@684tranminhtuan]

Amazing explanation. Thank you.

[@ManyStandAlone]

Best video on crc. I could hug you.

[@aris.konstantinidis]

Great explanation, thank you so much!

[@willmartin1748]

bro oh my god I was wondering why my CRC hw question made no sense, it's cause modulo 2 binary division makes no sense lol. The value goes into into 1 time even if it's a bigger value. Lol. Thank you for going through this clearly so I can get a grasp on it.

[@tsusec]

Thanks mate, you saved me alot of time!

[@baronbaron3507]

Hi, Is the patern the same thing as the polynoom?

[@bojanadraganovska2781]

Thank God for this video !

[@jrjr1684]

this video saves my life~~~~ thank you sooooo much

[@rooneymak2300]

Awesome explanation!!

[@nacirarmando8003]

Great explanation.Thank you!

[@giampierysantana]

Amazing !!!!!!! I really got it with you, thank you so much.

[@rjvnz]

what a great explanation!! If you were my professor, I would've done a million time better in undergrad engineering

[@sperera5916]

I got a problem. When you divide 010110110110 by 10001, the first division results in a 5 bit remainder which I do not need to get the next bit to add to the reminder. e.g. 10001 XOR 01011 = 11010 please help, how to proceed?

[@biswajitmoharana2390]

U need to take an all 0s devisor. u should take quotient as 0 not as 1 , as the starting value is 0 in the dividend. hope u understand.

[@goedeck1]

Thanks for explaining how the bottom number when dividing in modulo 2 can be bigger; that was baffling me.

[@luckyharbinger2054]

Enjoy your 1000th like, this helped me a great deal.

[@zakariahalil6860]

very distinct video, thanks

[@michaelroditis1952]

what is the result that you right on top of the division?

[@henrymiller5709]

well explained and easily understood thx

[@axonis2306]

Many youtube videos on the subject. This is one of the few that "get" it.

[@varunshekhar5108]

At 8:36 I think the quotient will not have 2 zeroes at the end....Only one zero was needed.

[@madhawapriyashantha3722]

yes .i got only 1 zero

[@amrmoneer5881]

your are a great professor

[@BubbleManxx]

This is the one, thanks Jacob.

[@revaldi99x]

Great video really helps!

[@RahulSiyanwal]

How did we concluded that the size of predetermined pattern should be 6 bits?

[@ahmh8411]

Probably a bit too late but for future reference the pattern was arbitrary, it can be anything as long as both the sender and receiver agree on a length.

[@itznukeey]

Great video

[@pongmaster9420]

Thanks brother, may lord bless you

[@nomanmalik677]

wow that's a really nice explaination I LOVE IT

[@c12-116]

what does it mean if the remainders are not zero?

[@yutingli3510]

amazing video!! thank you!

[@user-hu4yp4ml3c]

this is well explained, thank you (:

[@PradeepSanjeewa1]

Really helpful. Thanks

[@atalayozmen3222]

why do we write those numbers on top?

[@raghads3890]

thank you sooo much for this great explanation, you dont know how much it helps me:)

[@shikharchaudhary6984]

best explanation

[@The2bdkid]

What if D starts with a 0? It kind of screws up the division. EDIT: Nvm, ignore the leading zero and it works out.

[@TheSpore35]

can you make the video quieter? its too loud

[@R0hirrim]

You must be the god of CRC man

[@kaiserkarlisle8456]

Thank you so much , perfect

[@RishabhSharma_the_vlogger]

Computer Science made easy... thankyou :)

[@tifxmychemx]

Thank you so much!

[@meirzilkha]

Thanks this is magic!

[@mahadihassan1186]

Thanks bro really helpful

[@nouraalhajri607]

you just saved me thank you

[@baseldaoud8813]

why did you chose a pattern of 6-bits ?

[@biswajitmoharana2390]

This is a predefined n agreed upon value . That is generated by the ge nerater at sender site. Here its an example sir has shown.

[@mehdicharife2335]

Great but that doesn't explain why when you add the rest to the message and redo the division the rest becomes zero

[@XFaramir]

Nailed it ! thanks

[@adithravipai413]

thank you sir

[@iskallab5314]

Thank you so much

[@jirkadolezal8127]

thank you

[@mcm1322]

i did all the math in this video but my drive is still showing cyclic redundancy check :(