Cyclic Redundancy Check (CRC) - Computer Network
Cyclic Redundancy Check (CRC)
An error-detection technique used widely in today’s computer
networks is based on cyclic redundancy check (CRC) codes.
CRC codes are also known as polynomial codes, since it is possible to
view the bit string to be sent as a polynomial whose coefficients are
the 0 and 1 values in the bit string.
CRC codes operate as follows.
Consider the d-bit piece of data, D, that the sending node wants to
send to the receiving node.
The sender and receiver must first agree on an r + 1 bit pattern,
known as a generator, which we will denote as G.
We will require that the most significant (leftmost) bit of G be a 1.
An error-detection technique used widely in today’s computer
networks is based on cyclic redundancy check (CRC) codes.
CRC codes are also known as polynomial codes, since it is possible to
view the bit string to be sent as a polynomial whose coefficients are
the 0 and 1 values in the bit string.
CRC codes operate as follows.
Consider the d-bit piece of data, D, that the sending node wants to
send to the receiving node.
The sender and receiver must first agree on an r + 1 bit pattern,
known as a generator, which we will denote as G.
We will require that the most significant (leftmost) bit of G be a 1.
Post a Comment