diff --git a/latex/thesis/chapters/appendix.tex b/latex/thesis/chapters/appendix.tex
index 5531514..a80e542 100644
--- a/latex/thesis/chapters/appendix.tex
+++ b/latex/thesis/chapters/appendix.tex
@@ -810,10 +810,6 @@ $\gamma \in \left\{ 0.01, 0.05, 0.15 \right\}$.
 \end{figure}
 
 
-\chapter{Proximal Decoding as a Message Passing Algorithm}
-\label{chapter:Proximal Decoding as a Message Passing Algorithm}
-
-
 %\chapter{\acs{LP} Decoding using \acs{ADMM} as a Proximal Algorithm}%
 %\label{chapter:LD Decoding using ADMM as a Proximal Algorithm}
 %
diff --git a/latex/thesis/chapters/comparison.tex b/latex/thesis/chapters/comparison.tex
index 2c8c2e4..d6181e5 100644
--- a/latex/thesis/chapters/comparison.tex
+++ b/latex/thesis/chapters/comparison.tex
@@ -161,11 +161,13 @@ $\mathcal{O}\left( n \right)$ (see section TODO, \cite[Sec. VIII.]{lautern}).
 
 Both algorithms can be understood as message-passing algorithms, \ac{LP}
 decoding using \ac{ADMM} as similarly to \cite[Sec. III. D.]{original_admm}
-or \cite[Sec. II. B.]{efficient_lp_dec_admm} and proximal decoding as shown in
-appendix \ref{chapter:Proximal Decoding as a Message Passing Algorithm}.
+or \cite[Sec. II. B.]{efficient_lp_dec_admm} and proximal decoding by
+starting with algorithm \ref{alg:prox},
+substituting for the gradient of the code-constraint polynomial and separating
+it into two parts.
 The algorithms in their message-passing form are depicted in figure
 \ref{fig:comp:message_passing}.
-$M_{j\to i}$ denotes the message transmitted from \ac{CN} j to \ac{VN} i.
+$M_{j\to i}$ denotes a message transmitted from \ac{CN} j to \ac{VN} i.
 $M_{j\to}$ signifies the special case where a \ac{VN} transmits the same
 message to all \acp{VN}.
 %