Module binius_core::reed_solomon::reed_solomon
source · Expand description
Reed–Solomon codes over binary fields.
The Reed–Solomon code admits an efficient encoding algorithm over binary fields due to LCH14. The additive NTT encoding algorithm encodes messages interpreted as the coefficients of a polynomial in a non-standard, novel polynomial basis and the codewords are the polynomial evaluations over a linear subspace of the field. See the binius_ntt crate for more details.