Error detecting code - parity bit, Computer Networking

Error Detecting Code - Parity bit:

The general idea for achieving error detection and correction is to add some redundancy (i.e., some extra data) to a message, which receivers can use to check consistency of the delivered message, and to recover data determined to be erroneous. An error-detection scheme may be combined with a system for retransmissions of erroneous data

 A parity bit is a bit that is added to a group of source bits to ensure that the number of set bits (i.e., bits with value 1) in the outcome is even or odd. It is a very simple scheme that can be used to detect single error in the output.

2156_Error Detecting Code - Parity bit.png

Fig. Transmit data using a parity bit

Posted Date: 2/19/2013 1:07:03 AM | Location : United States







Related Discussions:- Error detecting code - parity bit, Assignment Help, Ask Question on Error detecting code - parity bit, Get Answer, Expert's Help, Error detecting code - parity bit Discussions

Write discussion on Error detecting code - parity bit
Your posts are moderated
Related Questions

What are the benefits accruable from networks The exact number of benefits accruable from networks cannot be enumerated easily in terms of monetary benefit. In order to unde

What are the most typical functional units of the Client/Server applications? Ans) typical functional units of the Client/Server applications User interface Business Logic

Q. Show the Data Encryption Standard? Data Encryption Standard - Bit-level encryption method designed by IBM - Adopted as standard for nonmilitary and nonclassified us

What is a jam signal A jam signal is broadcasts to network by the transmitting stations that detected the collision to ensure that all stations know of the collision. Every st

Determine the definition of HDLC HDLC has only one address field. In a LAN, any station may transmit to any other station. The receiving station needs to see its own address in


What's the difference among distance vector and link-state protocol?

Perfect Shuffle Permutation This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  X n-1, X n-2, X 0    (N is chosen such that N

Directly linked network have the lowest administrative distance of 0. They are considered the most reliable.