• A parity bit, also known as a check bit, is added to a string of binary code that indicates whether the number of 1-bits in the string is even (or) odd.
  • These bits are used as the simplest form of error detecting code.
  • Parity bits are only suitable for detecting the single error, it cannot correct any error.
  • There is no way to determine which particular bit is corrupted.
  • There are two varients of parity bits:
     1.Even parity
     2.Odd parity
  • Even Parity:
  • In case of even parity, for a given set of bits, the occurrence of bits whose value is 1 is  counted . if that count is odd, the parity bit value is set to 1, making the total count of  occurrences of 1's in whole set an even number. If the count of 1's in a given set of bits already even, the parity bits value is 0.

  • Odd Parity:
  • In the case of odd parity, for a given for a given set of bits, if the count of bits with a value of 1 is even, the parity bit value is set to 1 making the total count of 1's in the whole set an odd number. If the count of bits with a value of 1 is odd, the count is already odd so it is 0.
              Image result for odd parity example
  • Because of it's simplicity, parity is used in many applications where an operation can be repeated in case of difficulty, or where simply detecting the error is helpful.
  • In the Transmission scenario,  
     for example,