Construct · 1 fields · 1 citations

Reed-Solomon code: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
Reed-Solomoncode1 CONSTRUCTReed-Solomon codeREED · CODING THEORY

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

Coding theory

nonbinary block codes defined by polynomials over finite fields that correct symbol errors and bursts.

In coding theory, Reed-Solomon code refers to nonbinary block codes defined by polynomials over finite fields that correct symbol errors and bursts. This meaning comes from Reed (1960) in Journal of the Society for Industrial and Applied Mathematics.[1]

Unit
Recovery means
Measured by

Next

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

See how Reed-Solomon code sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

Berlekamp-Massey algorithm1 fields · 1 citationsanchor · a standalone constructblock3 fields · 6 citationsjingle · one word, three constructscode3 fields · 6 citationsjingle · one word, three constructs

References

  1. Reed, I. S., & Solomon, G. (1960). Polynomial Codes Over Certain Finite Fields. Journal of the Society for Industrial and Applied Mathematics, 8(2), 300-304. https://doi.org/10.1137/0108018

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