parity bit

Definitions

  • WordNet 3.6
    • n parity bit (computer science) a bit that is used in an error detection procedure in which a 0 or 1 is added to each group of bits so that it will have either an odd number of 1's or an even number of 1's; e.g., if the parity is odd then any group of bits that arrives with an even number of 1's must contain an error
    • ***

Usage

In literature:

The standard PDP alphanumeric paper tape code includes an odd parity bit which may be checked by the program.
"Preliminary Specifications: Programmed Data Processor Model Three (PDP-3)" by Digital Equipment Corporation
***

In news:

What is a parity bit .
Anne Look/GlobalPost Wearing white has also become a bit of a symbol for parity in Senegal .
( PAR ity file) A file that contains the computed parity bits from a source file PAR files are generated from Usenet archives that have been broken into multiple files because of file size limitations on news servers.
Parity checking adds an extra parity cell to each byte of memory and an extra parity bit to each byte transmitted.
Content tagged with " parity bit".
What is a parity bit.
***

In science:

The iterative decoding algorithm used, the sumproduct algorithm, requires time proportional to the number of one bits in the parity check matrix times the number of iterations needed, which is generally fixed at some maximum, e.g. 20, after which the algorithm declares failure.
Current status of the DARPA Quantum Network
At present we fix the density so that each data bit is involved in an average of 5 parity checks; as a result, the density need not be sent to the other party.
Current status of the DARPA Quantum Network
This matrix can be expressed in an equivalent form by a bipartite graph G whose variable nodes (appearing on the left of G ) represent the the code bits, and whose parity-check nodes (appearing on the right of G ) represent the linear constraints defined by H .
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
So the task is essentially how to decide if |x| = k efficiently if we can query the XOR of arbitrary subsets of the bits of x.1 It is easy to see that deciding if the size of a parity is k is the same problem as deciding if it is n − k .
The non-adaptive query complexity of testing k-parities
In particular, in , the authors propose coding schemes, where, for every block of information packets, parity packets are transmitted such that ∀i, the ith bit from each packet arranged in sequence forms a codeword from an erasure correcting codebook.
Anonymous Networking amidst Eavesdroppers
***