diff --git a/reed_solomon.py b/reed_solomon.py
index 297a1e70118204dc4cce8d5b66a086ea149f15d3..222705b7c976f7306aee85337112bb88b96ff868 100644
--- a/reed_solomon.py
+++ b/reed_solomon.py
@@ -31,4 +31,11 @@ def check_nb_error(l: list, p: polynome) -> int:
 		if (item % p.prime_mod) != (p.evaluate(_) % p.prime_mod):
 			print(f"{item} != p.evaluate({_}) = {p.evaluate(_)}")
 			nbr_error += 1
-	return nbr_error
\ No newline at end of file
+	return nbr_error
+
+
+def reed_decode(l: list) -> polynome:
+	for points in get_possibilities(l):
+		if (check_nb_error(l, lagrange_compute(points)) <= 9):
+			# Possibilité d'optimiser en evitant de compute 2 fois le poly
+			return lagrange_compute(points)
\ No newline at end of file