From 356e056a927a144b3f7cb8aad9573b9dcac855d6 Mon Sep 17 00:00:00 2001
From: Andreas Tsouchlos <an.tsouchlos@gmail.com>
Date: Mon, 23 Jan 2023 15:20:03 +0100
Subject: [PATCH] Added motivation

---
 .../midterm/sections/theoretical_background.tex        | 10 ++++++++--
 1 file changed, 8 insertions(+), 2 deletions(-)

diff --git a/latex/presentations/midterm/sections/theoretical_background.tex b/latex/presentations/midterm/sections/theoretical_background.tex
index cbbbf17..441f6ed 100644
--- a/latex/presentations/midterm/sections/theoretical_background.tex
+++ b/latex/presentations/midterm/sections/theoretical_background.tex
@@ -8,8 +8,14 @@
 
 \begin{frame}[t]
     \frametitle{Motivation}
-
-    \todo{TODO}
+    \begin{itemize}
+        \item The general [ML] decoding problem for linear codes and the general problem
+            of finding the weights of a linear code are both NP-complete. \cite{ml_np_hard_proof}
+        \item The standard message-passing algorithms used for decoding [LDPC and turbo codes]
+            are often difficult to analyze. \cite{feldman_thesis}
+        \item The iterative message–passing algorithms preffered in practice do not guarantee
+            optimality and may fail to decode correctly when the graph contains cycles \cite{ldpc_conv}
+    \end{itemize}
 \end{frame}