Parity bit

Known as: Parity code, Parity checking, Parity 
A parity bit, or check bit, is a bit added to a string of binary code that indicates whether the number of 1-bits in the string is even or odd… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
We review the most recent advanced concepts and methods employed in the cutting-edge spectrally efficient coherent fiber-optic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
RAID storage systems protect data from storage errors, such as data corruption, using a set of one or more integrity techniques… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Deliberate injection of faults into cryptographic devices is an effective cryptanalysis technique against symmetric and… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper, we present efficient self-checking implementations valid for all existing adder and arithmatic and logic unit (ALU… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes… (More)
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper considers the performance of single parity check (SPC) multidimensional product codes in an Additive White Gaussian… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper, two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Gallager's (1962) low-density binary parity check codes have been shown to have near-Shannon limit performance when decoded using… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
A function f is realizable in bounded depth and g(n) size .if there is a sequence of circuits 0 1 , C2 ,.·•• mane np of !\,V, and… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1962
Highly Cited
1962
A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains… (More)
  • figure 11.1
  • figure 11.2
  • figure 11.3
  • figure 11.4
  • figure 11.5
Is this relevant?