# Parity bit

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Review

2017

Review

2017

- Journal of Lightwave Technology
- 2017

We review the most recent advanced concepts and methods employed in the cutting-edge spectrally efficient coherent fiber-opticâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- FAST
- 2008

RAID storage systems protect data from storage errors, such as data corruption, using a set of one or more integrity techniquesâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- CHES
- 2003

Deliberate injection of faults into cryptographic devices is an effective cryptanalysis technique against symmetric andâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IEEE Trans. VLSI Syst.
- 2003

In this paper, we present efficient self-checking implementations valid for all existing adder and arithmatic and logic unit (ALUâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE Trans. Information Theory
- 2001

This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codesâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE Trans. Communications
- 2001

This paper considers the performance of single parity check (SPC) multidimensional product codes in an Additive White Gaussianâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- IEEE Trans. Communications
- 1999

In this paper, two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parityâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- IEEE Communications Letters
- 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

- 22nd Annual Symposium on Foundations of Computerâ€¦
- 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)

Is this relevant?

Highly Cited

1962

Highly Cited

1962

- IRE Trans. Information Theory
- 1962

A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column containsâ€¦Â (More)

Is this relevant?