diff --git a/latex/thesis/chapters/discussion.tex b/latex/thesis/chapters/discussion.tex
index 26d2c20..5c586a0 100644
--- a/latex/thesis/chapters/discussion.tex
+++ b/latex/thesis/chapters/discussion.tex
@@ -10,6 +10,7 @@ exhibit an error floor.
 The decoding algorithms could then be assessed for use in very
 high reliability applications, where traditional methods like \ac{BP} or the
 min-sum-algorithm fall short.
+\todo{Doesn't make sense}
 
 As mentioned in section \ref{subsec:prox:conv_properties}, the alternating
 minimization of the two gradients in the proximal decoding algorithm leads to
@@ -49,6 +50,9 @@ This could be usefull, for example, to mitigate the slow convergence of
 \ac{ADMM} \cite[3.2.2]{distr_opt_book}.
 Subsequently introducing additional parity checks might be a way of combining
 the best properties of proximal decoding, \ac{LP} decoding using \ac{ADMM} and
-\textit{adaptive \ac{LP} decoding} \cite{alp} to obtain a decoder relatively
-efficiently approximating \ac{ML} performance.
-
+\textit{adaptive \ac{LP} decoding} \cite{alp} to obtain a decoder efficiently
+approximating \ac{ML} performance.
+\todo{It turns out that ADMM is more compuationally efficient than proximal
+    decoding.
+    Find a way to combine them that still makes sense (maybe exploiting the
+    fact that the BER is so much better than the FER, in constrasto to ADMM)}