Construct · 1 fields · 1 citations

BCJR algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Coding theory

an algorithm that computes per-symbol posterior probabilities on a code trellis using forward and backward recursions.

In coding theory, BCJR algorithm refers to an algorithm that computes per-symbol posterior probabilities on a code trellis using forward and backward recursions. This meaning comes from Bahl (1974) in IEEE Transactions on Information Theory.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how BCJR algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

code3 fields · 6 citationsjingle · one word, three constructs forward2 fields · 2 citationsjingle · one word, two constructs information4 fields · 5 citationsjingle · one word, four constructs

References

Bahl, L., Cocke, J., Jelinek, F., & Raviv, J. (1974). Optimal decoding of linear codes for minimizing symbol error rate (Corresp.). IEEE Transactions on Information Theory, 20(2), 284-287. https://doi.org/10.1109/tit.1974.1055186

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct