Research proof index

Correctness theorem for Berlekamp-Welch decoder: If a codeword is close to a polynomial p of degree < k then the decoder succeeds and returns some p. ### Parameters: - e k : ℕ - Error capacity and degree bound - [NeZero n] - Non-zero codeword length - ωs : Fin n → F - Distinct evaluation points (injective mapping) - f : Fin n → F - Recei...