Written Report in

Mathematics in Mathematics
in the Modern World
 COMMUNICATING EFFICIENTLY – ERROR DETECTION AND CORRECTION

Error - An error is a situation that occurs the output data does not equate with the input data.
During communication, digital indicators encounter noise that can possibly initiate errors in the
binary bits moving from one system to another.

Types of errors

 Single bit error - As it name signifies- The term single bit error means that only one bit
of the given data unit (such as byte, character or packet) is changed from 0 to 1 or from 1
to 0.
 Burst error (multiple error) - The term burst error means that two or more bit of the
given date unit have changed from 0 to 1 or from 1 to 0. A burst error does not means
that error occurs in consecutive bits.

 Causes of Errors

Transmission Errors: These errors are occurred in the communication media due to signal
distortion or attenuation.

Storage errors: These errors occur due to data storage errors where the memory tracks will
corrupt during writing of by any power supply failures.

 ERROR DETECTION is the discovery of errors, resulting from noise or other

deficiencies, while in transit from the transmitter to the receiver.

Types of Error detection

1. Parity Checking
Parity bit means nothing but an additional bit added to the data at the transmitter before
transmitting the data. Before adding the parity bit, number of 1’s or zeros is calculated in
the data. Based on this calculation of data an extra bit is added to the actual information /
data. The addition of parity bit to the data will result in the change of data string size.
 A. Even Parity
If the data has even number of 1’s, the parity bit is 0. Ex: data is 10000001 -> parity bit 0
Odd number of 1’s, the parity bit is 1. Ex: data is 10010001 -> parity bit 1
B. Odd Parity
If the data has odd number of 1’s, the parity bit is 0. Ex: data is 10011101 -> parity bit 0
Even number of 1’s, the parity bit is 1. Ex: data is 10010101 -> parity bit 1

2. Checksum
 In the checksum error detection system, the data is separated into sections for each
bit.
 On the sender’s end, the sections are added using 1’s aggregate arithmetic to get the
sum. The sum is then aggregated to get the checksum.
 The checksum section is sent along with the standard data sections.
 On the receiver’s end, all received sections are added using 1’s aggregate arithmetic
to get the sum. This sum is then likewise aggregated.
 If the result is zero, the received data is accepted; otherwise, the received data is
rejected.
3. Cyclic Redundancy Check (CRC)
 Unlike the checksum system, which is grounded in addition, CRC is based on binary
division.
 In CRC, an arrangement of repetitious bits (referred to as cyclic redundancy check bits)
are attached to the end of data unit, so that the emerging data unit becomes accurately
divisible by another prearranged binary number.
 On the receiving end, the arriving data unit is divided by the same number. If at this stage
there is no remainder, the data unit is taken to be accurate, and is consequently accepted.
 A remainder specifies that the data unit has been impaired in transit, and as such must be
declined.

4. Longitudinal Redundancy Check

 In longitudinal redundancy method, a BLOCK of bits are arranged in a table format (in rows and
columns) and we will calculate the parity bit for each column separately. The set of these parity
bits are also sent along with our original data bits.
 Longitudinal redundancy check is a bit by bit parity computation, as we calculate the parity of
each column individually.
 This method can easily detect burst errors and single bit errors and it fails to detect the 2 bit
errors occurred in same vertical slice.