Cyclic redundancy error

3

3DCulprit

1. When i try to download certain software especially
games it comes up with "Cyclic redundancy error", how can
i stop this from happening? . I have just formatted the
hard drive and it says this................


Please help if you can!!!!!
 
N

Nicholas

CRC error detection computes the remainder of a polynomial division
of a generator polynomial into a message. The remainder, which is usually
16 or 32 bits, is then appended to the message. When another remainder is
computed, a nonzero value indicates an error. Depending on the generator
polynomial's size, the process can fail in several ways, however. It is very
difficult to deturmine how effective a given CRC will be at detecting errors.
The probability that a random code word is valid (not detectable as an error),
is completely a function of the code rate: 1 - 2-(n - k). Where n is the number
of bits of formed from k original bits of data , (n - k) is the number of
redundant bits, r.
This is a software error. To resolve this issue, install the latest update for the software.

--
Nicholas

------------------------------------------------------------------------


|
|
| 1. When i try to download certain software especially
| games it comes up with "Cyclic redundancy error", how can
| i stop this from happening? . I have just formatted the
| hard drive and it says this................
|
|
| Please help if you can!!!!!
|
 
3

3DCulprit

Thanks!




-----Original Message-----
CRC error detection computes the remainder of a polynomial division
of a generator polynomial into a message. The remainder, which is usually
16 or 32 bits, is then appended to the message. When another remainder is
computed, a nonzero value indicates an error. Depending on the generator
polynomial's size, the process can fail in several ways, however. It is very
difficult to deturmine how effective a given CRC will be at detecting errors.
The probability that a random code word is valid (not detectable as an error),
is completely a function of the code rate: 1 - 2-(n - k). Where n is the number
of bits of formed from k original bits of data , (n - k) is the number of
redundant bits, r.
This is a software error. To resolve this issue, install
the latest update for the software.
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Top