Explore BrainMass
Share

Single parity bit & Two-dimensional parity checksum schemes

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

Suppose that the information content of a packet is the bit pattern 1111000010100101 and an even parity is being used

[a] What would be the checksum field in a single parity bit scheme?

[b] What would be the value of the checksum field for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum is used.

https://brainmass.com/computer-science/algorithms/single-parity-bit-two-dimensional-parity-checksum-schemes-115031

Solution Preview

Even parity for a bit sequence (single row/column) is achieved when number of 1 bits in "the bit sequence and the parity bit" is even. Which means --

* if number of 1 bits in bit sequence is even, parity bit will be set to 0, and
* if number of 1 bits in bit sequence is odd, parity bit will be set to 1.

[a] ...

Solution Summary

Solution also explains the meaning of "even parity" for a bit sequence.

\$2.19