From 5efdea242c3f95b0e328c51525eaae8cfff76b7d Mon Sep 17 00:00:00 2001
From: Andreas Tsouchlos <an.tsouchlos@gmail.com>
Date: Thu, 26 Jan 2023 17:51:18 +0100
Subject: [PATCH] Added lautern citation

---
 latex/presentations/midterm/presentation.bib          | 11 +++++++++++
 .../midterm/sections/forthcoming_examination.tex      |  2 ++
 2 files changed, 13 insertions(+)

diff --git a/latex/presentations/midterm/presentation.bib b/latex/presentations/midterm/presentation.bib
index b96b971..485bc10 100644
--- a/latex/presentations/midterm/presentation.bib
+++ b/latex/presentations/midterm/presentation.bib
@@ -110,3 +110,14 @@
   doi={10.1109/TIT.2004.842696}
 }
 
+@ARTICLE{lautern,
+  author={Gensheimer, Florian and Dietz, Tobias and Kraft, Kira and Ruzika, Stefan and Wehn, Norbert},
+  journal={IEEE Transactions on Information Theory}, 
+  title={A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding}, 
+  year={2020},
+  volume={66},
+  number={8},
+  pages={4819-4833},
+  doi={10.1109/TIT.2020.2984247}
+}
+
diff --git a/latex/presentations/midterm/sections/forthcoming_examination.tex b/latex/presentations/midterm/sections/forthcoming_examination.tex
index d2d1ab8..1b5ad28 100644
--- a/latex/presentations/midterm/sections/forthcoming_examination.tex
+++ b/latex/presentations/midterm/sections/forthcoming_examination.tex
@@ -13,6 +13,8 @@
         \item Test the (Alternating Direction Method of Multipliers) ADMM
               as an optimization method for LP Decoding
             \begin{itemize}
+                \item In LP decoding, the ML decoding problem is reduced to a linear program,
+                    which can be solved in polynomial time \cite{lautern}
                 \item ADMM is intended to blend the decomposability
                     of dual ascent with the superior convergence properties of the method
                     of multipliers \cite{distr_opt_book}