An error occurred while fetching folder content.
Select Git revision
math-tp-001
-
-
- Open in your IDE
- Download source code
Forked from
florian.burgener / ISC_122 - Travail Pratique 001 - Code de Reed-Solomon
Source project has a limited visibility.
dario.genga
authored
The decode works like that : - Parse each combination of points possible (exclude the correct points) - Create a sublist of points with all corrects points and the current combination of points - Create the lagrange polynomial with the sublist of points - Parse each points to verify if the polynomial is correct - Pass the x value of each points through the lagrange polynomial - If the result is the same that the y value, then the point is correct - Verify if we have enough valid points, so it must be equal or higher than m + n points - Decode the message
Name | Last commit | Last update |
---|