Construct · 1 fields · 1 citations

min-sum decoding: 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

a simplified belief propagation decoder for LDPC codes that replaces check-node calculations with minimum operations.

In coding theory, min-sum decoding refers to a simplified belief propagation decoder for LDPC codes that replaces check-node calculations with minimum operations. This meaning comes from Fossorier (1999) in IEEE Transactions on Communications.[1]

Unit
Recovery means
Measured by

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

See how min-sum decoding 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

belief4 fields · 4 citationsjingle · one word, four constructs decoder3 fields · 6 citationsjingle · one word, three constructs propagation2 fields · 2 citationsjingle · one word, two constructs

References

Fossorier, M. P. C., Mihaljevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673-680. https://doi.org/10.1109/26.768759

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