Reed–Solomon Lab
Reed–Solomon Sandbox RS(48,38) · t=5 GF(2⁸) · p(x)=x⁸+x⁴+x³+x²+1 · α=0x02
Correction budget n − k = used 2·e + s =
error ×2erasure ×1spare
STEP 1

Encode: message + parity = codeword

The message bytes are coefficients of m(x). The encoder appends the remainder of m(x)·xn−k ÷ g(x), so the full codeword c(x) is divisible by the generator g(x) = (x−α⁰)(x−α¹)…(x−αn−k−1).

STEP 2

Channel: received word r(x)

Click any byte to corrupt it with a random value, or switch to Erasure to flag it as unreadable. Click again to restore it. Shift-click always toggles an erasure.

STEP 3

Syndromes Sᵢ = r(αⁱ)

STEP 4

Error locator Λ(x)

Berlekamp–Massey

STEP 5

Chien search: where does Λ(x) vanish?

Each bar is |Λ(Xp⁻¹)| for byte position p. A root (value 0, green marker) means p is an error location. Violet markers are the erasures you flagged, which the decoder already knows.

STEP 6

Forney algorithm: error values

STEP 7

Decoded codeword

Sent
Received
Decoded