Reed–Solomon Coding and Decoding 1. Input Bitstream to Symbols Given input bitstream: 101011000… Choose symbol size: m = 3 ⇒ symbols in GF(2³) Grouping bits: 101 | 011 | 000 Binary to decimal symbols: [5, 3, 0] 2. Finite Field Construction GF(2³) Primitive polynomial: p(x) = x³ + x + 1 Element Polynomial Binary Decimal α⁰ 1 001 1 α¹ α 010 2 α² α² 100 4 α³ α + 1 011 3 α⁴ α² + α 110 6 α⁵ α² + α + 1 111 7 α⁶ α² + 1 101 5 3. Message Polynomial Choose RS(7,3): n = 7, k = 3 Message symbols: [5, 3, 0] Message polynomial: m(x) = 5 + 3x + 0x² 4. Generator Polynomial Number of parity symbols: n − k = 4 Generator polynomial: g(x) = (x − α)(x − α²)(x − α³)(x − α⁴) Expanded form: g(x) = x⁴ + 6x³ + x² + 6x + 1 5. RS Encoding (Polynomial Division) Multiply message by x⁴: x⁴m(x) = 5x⁴ + 3x⁵ Divide by generator polynomial: r(x) = 6 + 4x + 2x² + 5x³ Codeword polynomial: c(x) = x⁴m(x) + r(x) Final codeword symbols: [...