How does longitudinal parity work??
What will be an ideal response?
?The first step of this parity scheme involves grouping individual characters together in a block. Each character (also called a row) in the block has its own parity bit. In addition, after a certain number of characters are sent, a row of parity bits, or a block character check, is also sent. Each parity bit in this last row is a parity check for all the bits in the column above it. If one bit is altered in Row 1, the parity bit at the end of Row 1 signals an error. In addition, the parity bit for the corresponding column also signals an error. If two bits in Row 1 are flipped, the Row 1 parity check will not signal an error, but two column parity checks will signal errors. This is how longitudinal parity is able to detect more errors than simple parity. Note, however, that if two bits are flipped in Row 1 and two bits are flipped in Row 2, and the errors occur in the same column, no errors will be detected.
You might also like to view...
In general, a(n) ____________________ is a request for goods or services that comes from any point in an organization.
Fill in the blank(s) with the appropriate word(s).
When an application is running, the control having the ____________ is the one that receives the user’s keyboard input.
a. focus b. scope c. data d. tab index
The __________ is a block cipher intended to replace DES for commercial applications. It uses a 128-bit block size and a key size of 128, 192, or 256 bits.
Fill in the blank(s) with the appropriate word(s).
____________________ are similar to the yellow sticky notes you might attach to a printout.
Fill in the blank(s) with the appropriate word(s).