Construct · 1 fields · 1 citations

Berlekamp-Massey 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

algorithm that finds the shortest linear feedback shift register generating a given sequence, used to decode BCH and Reed-Solomon codes.

In coding theory, Berlekamp-Massey algorithm refers to algorithm that finds the shortest linear feedback shift register generating a given sequence, used to decode BCH and Reed-Solomon codes. This meaning comes from Massey (1969) 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 Berlekamp-Massey 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

feedback4 fields · 5 citationsjingle · one word, four constructs information4 fields · 5 citationsjingle · one word, four constructs Reed-Solomon code1 fields · 1 citationsanchor · a standalone construct

References

Massey, J. (1969). Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory, 15(1), 122-127. https://doi.org/10.1109/tit.1969.1054260

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