Cyclic Redundancy Check ( incl. Examples and Step-By-Step Guide) - Computer Networks

preview_player
Показать описание
Thanks for subscribing!

---

This video is about the Cyclic Redundancy Check (CRC) that is used throughout Computer Networks.
In the video the following concepts are explained:
- The Cyclic Redundancy Check in general (features and an overview).
- How to apply the CRC (in terms of a step-by-step guide).
- Two examples (an easy and an 'intermediate' exercise).
- The performance and quality of the CRC.

---

Note that I made a typo in the answer of example 1. T(x) should be 1001110, I missed out a 1 at the end of the sequence on the slide.
The typo can be deduced from the the addition of the answers for (x)^(r) * M(x) and the remainder.

---

If you thought this video was useful, make sure to give it a like!
If you want to support this channel, make sure to subscribe.
If you have any questions, use the comment section.

This video has been published by MisterCode.
Рекомендации по теме
Комментарии
Автор

Very good Video, thank you.
But I think at 8:25 the result is 1001110 and not 100110. You forgot a 1.

JPTebbe
Автор

Very nice video, had to watch 2 videos before yours and didn't really understand but now I do!

Terminator
Автор

Thanks man, you really know how to explain thing I get it now

theRealPito
Автор

thanks a lot. it was really helpful. i am able to do my assignment, keep it up.u r the best

samedia
Автор

Thanks a bunch, had a bit of a hard time understanding this after lecture, but the video explaining it very well!

miicro
Автор

thank you so much man ! you saved my exam !!!

RobertMunteanu
Автор

Hi Very well explained.
Can you explain in following CRC format, what is start value and target value means? How to consider that?
'3bit CRC over bits 31 to 5 polynom: x^3+x+1, start value: 111b, target value 000b.'

aamirusaf
Автор

Nice..
How we are choosing G(x) ? Suppose for 32bit binary

sulfikerpanur
Автор

How to choose polynomial? suppose I have 256 bit data then what should be CRC size CRC-8, CRC-16, CRC-32 ?

rajeevkamal
Автор

How sender and reciever share the generator polynomial, and how we choose it?

tahaait
Автор

Sir please explain the vtu computer network lab experiments with code

chandanar
Автор

How do you know the generator code appropriate of the message code?

medtech
Автор

Good video !. I have a question, How can i use this method in c and c++ language ?

heaptv
Автор

although i am thankful for the tutorial its not very directed, in the sense that i often drifted away mentally because it seemed like not everything you said and showed moved towards the goal of understanding the method very straight and directly. you have good knowledge but now work on your teaching to become a successful youtuber. its still a like for now, though

joschk
Автор

I'm getting crc error on my android during rar/zip file extraction tell me what to do?

faiaz
Автор

Thank you, sir. Hope you're well. Am reading a book TCP/IP illustrated, volume 1, the protocols by kevin R. Fall and W. Richard Stevens, and the CRC mod 2 long division in the book is different from the one in this video, and using the method in your video, i got a different answer from what they got. also they said that what is appended at the end of the message(m(x)) to form the message to be transmitted(t(x)) is 1 complement's of the remainder. On receipt, the book said the division is done again, and if the remainder is different from what was appended to m(x), then there's an error. These authors are big guys in their field, please can you explain what is happening. cheers. Below is the link to the division

evanchime
Автор

Can anyone pls explain me how x^3+x+1== 1011

divijnagendra