Polynomial Codes over Certain Finite Fields

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.

Type

Journal article

Intellectual base

Primary research

Year

1960

DOI

10.1137/0108018

Link

https://doi.org/10.1137/0108018

Cited from

information_theory, systems_cybernetics

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Encoding And Decoding
  • A Reed–Solomon error-correcting code, as used on a compact disc, is the prime's cleanest formal instance and exhibits every commitment.

    This sourceIntroduces Reed–Solomon codes — encoding by polynomial evaluation over a finite field with added parity, decoded by error location and correction up to the designed redundancy.

• Redundancy

  • This sourceReed-Solomon distributed localized redundancy structure.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:8f720b5c1ffe · see in the full table