Definitioncore
Reed-Solomon code
Also called RS code.
Maximum-distance-separable code over a finite field, from evaluations of polynomials of bounded degree.
Maximum-distance-separable code over a finite field, from evaluations of polynomials of bounded degree.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag G5ZPZ8 Edit this page History Report an error