From dfb1fce598ada577514ff39c6290cb0a018db223 Mon Sep 17 00:00:00 2001
From: jonas <jonas.stirnemann@etu.hesge.ch>
Date: Mon, 13 Dec 2021 16:29:35 +0100
Subject: [PATCH] =?UTF-8?q?test=20b=C3=A9b=C3=A9=20lagrange,=20marche=20pa?=
=?UTF-8?q?s?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
---
reed_solomon.py | 15 ++++++++++++++-
1 file changed, 14 insertions(+), 1 deletion(-)
diff --git a/reed_solomon.py b/reed_solomon.py
index b2f1aba..1427e9d 100644
--- a/reed_solomon.py
+++ b/reed_solomon.py
@@ -21,8 +21,21 @@ def get_possibilities(l: list):
return p
+# l : List of tuple (x, y)
def lagrange_compute(l: list) -> polynome:
- pass
+ # Produit de k = 0 > n
+ # bébé lagrange pour premier tuple choisit
+ from inverse_mult import inverse_mult
+
+ x = l[0][0]
+ coefs = []
+ for i, t in enumerate(l):
+ if(x != l[i][0]):
+ print(f"")
+ print(f"{t[0] * x} / inverse({x - t[0]} - 229)")
+ coefs.append(t[0] * inverse_mult(x - t[0], 229))
+ print(f"DEBUG {coefs}")
+ return polynome(coefs)
def check_nb_error(l: list, p: polynome) -> int:
--
GitLab