full_reed_solomon_code
def
The full-length Reed-Solomon code of dimension $k$ over a commutative ring $F$ is the set of functions from $F$ to $F$ obtained by evaluating polynomials of degree strictly less than $k$.
Statement
def full_reed_solomon_code (F : Type*) [CommRing F] (k : ℕ) : Set (F → F)
- Defined in
- arXiv:2611.07607
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Used by 1
- zero_mem_full_reed_solomon_codeFor any commutative ring $F$ and natural number $k$, the constant zero function is a codeword in the full-length Reed-Solomon code of…
Read back from the Lean
Given a type F with a commutative ring structure and a natural number k, full_reed_solomon_code F k is defined as the set of functions c : F → F for which there exists a polynomial P : Polynomial F such that the degree of P (in WithBot ℕ) is strictly less than k and c is the function sending each α : F to the evaluation of P at α (Polynomial.eval α P).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The full-length Reed-Solomon code of dimension k over F consists of all evaluations of polynomials of degree less than k. -/ def full_reed_solomon_code (F : Type*) [CommRing F] (k : ℕ) : Set (F → F) := {c | ∃ P : Polynomial F, Polynomial.degree P < (k : WithBot ℕ) ∧ c = fun α => Polynomial.eval α P}