Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Install
Faster access than browser!
 

BCJR algorithm and Low-density parity-check code

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between BCJR algorithm and Low-density parity-check code

BCJR algorithm vs. Low-density parity-check code

The BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes). In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel.

Similarities between BCJR algorithm and Low-density parity-check code

BCJR algorithm and Low-density parity-check code have 5 things in common (in Unionpedia): Binary symmetric channel, David J. C. MacKay, Forward error correction, Maximum a posteriori estimation, Turbo code.

Binary symmetric channel

A binary symmetric channel (or BSC) is a common communications channel model used in coding theory and information theory.

BCJR algorithm and Binary symmetric channel · Binary symmetric channel and Low-density parity-check code · See more »

David J. C. MacKay

Sir David John Cameron MacKay (22 April 1967 – 14 April 2016) was a British physicist, mathematician, and academic.

BCJR algorithm and David J. C. MacKay · David J. C. MacKay and Low-density parity-check code · See more »

Forward error correction

In telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels.

BCJR algorithm and Forward error correction · Forward error correction and Low-density parity-check code · See more »

Maximum a posteriori estimation

In Bayesian statistics, a maximum a posteriori probability (MAP) estimate is an estimate of an unknown quantity, that equals the mode of the posterior distribution.

BCJR algorithm and Maximum a posteriori estimation · Low-density parity-check code and Maximum a posteriori estimation · See more »

Turbo code

In information theory, turbo codes (originally in French Turbocodes) are a class of high-performance forward error correction (FEC) codes developed around 1990–91 (but first published in 1993), which were the first practical codes to closely approach the channel capacity, a theoretical maximum for the code rate at which reliable communication is still possible given a specific noise level.

BCJR algorithm and Turbo code · Low-density parity-check code and Turbo code · See more »

The list above answers the following questions

BCJR algorithm and Low-density parity-check code Comparison

BCJR algorithm has 11 relations, while Low-density parity-check code has 76. As they have in common 5, the Jaccard index is 5.75% = 5 / (11 + 76).

References

This article shows the relationship between BCJR algorithm and Low-density parity-check code. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »