From d99694efba1c3545e07d1acfd4f12d559c06e0cf Mon Sep 17 00:00:00 2001
From: Andreas Tsouchlos <an.tsouchlos@gmail.com>
Date: Mon, 23 Jan 2023 20:12:24 +0100
Subject: [PATCH] Renamed tikzmarknew to tikzbracemark

---
 .../midterm/sections/examination_results.tex         | 12 +++++++-----
 1 file changed, 7 insertions(+), 5 deletions(-)

diff --git a/latex/presentations/midterm/sections/examination_results.tex b/latex/presentations/midterm/sections/examination_results.tex
index 01c56f3..b86ddc4 100644
--- a/latex/presentations/midterm/sections/examination_results.tex
+++ b/latex/presentations/midterm/sections/examination_results.tex
@@ -234,7 +234,8 @@ Output $\boldsymbol{\hat{x}}$
 \end{frame}
 
 
-\newcommand{\tikzmarknew}[1]{\tikz[overlay,remember picture] \node (#1) {};}
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\newcommand{\tikzbracemark}[1]{\tikz[overlay,remember picture] \node (#1) {};}
 
 \newcommand*{\AddNote}[4]{%
     \begin{tikzpicture}[overlay, remember picture]
@@ -245,6 +246,7 @@ Output $\boldsymbol{\hat{x}}$
     \end{tikzpicture}
 }%
 
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \begin{frame}[t, fragile]
     \frametitle{Proximal Decoding: Improvement using ``ML-on-List''}
     \setcounter{footnote}{0} 
@@ -263,18 +265,18 @@ Output $\boldsymbol{\hat{x}}$
         \begin{algorithm}[caption={}, label={},
             basicstyle=\fontsize{6.5}{7.5}\selectfont
             ]
-$\boldsymbol{s}^{\left( 0 \right)} = \boldsymbol{0}$$\hspace{4.185cm}\tikzmarknew{prox-start}$
+$\boldsymbol{s}^{\left( 0 \right)} = \boldsymbol{0}$$\hspace{4.185cm}\tikzbracemark{prox-start}$
 for $k=0$ to $K-1$ do
     $\boldsymbol{r}^{\left( k+1 \right)} = \boldsymbol{s}^{(k)} - \omega \nabla L \left( \boldsymbol{s}^{(k)}; \boldsymbol{y} \right) $
     Compute $\nabla h\left( \boldsymbol{r}^{\left( k+1 \right) } \right)$
     $\boldsymbol{s}^{\left( k+1 \right)} = \boldsymbol{r}^{(k+1)} - \gamma \nabla h\left( \boldsymbol{r}^{\left( k+1 \right) } \right) $
     $\boldsymbol{\hat{x}} = \text{sign}\left( \boldsymbol{s}^{\left( k+1 \right) } \right) $
     If $\boldsymbol{\hat{x}}$ passes the parity check condition, output $\boldsymbol{\hat{x}}$
-end for $\tikzmarknew{prox-end}$
-Find $N$ most probably wrong bits $\hspace{2cm}\tikzmarknew{ml-start}$
+end for $\tikzbracemark{prox-end}$
+Find $N$ most probably wrong bits $\hspace{2cm}\tikzbracemark{ml-start}$
 Generate variations $\boldsymbol{\tilde{x}}_n$ of $\boldsymbol{\hat{x}}$ with the $N$ bits modified
 Compute $d\left( \boldsymbol{ \tilde{x}}_n, \boldsymbol{\hat{x}} \right) \forall n \in \left[ 1 : N-1 \right] $
-Output $\boldsymbol{\tilde{x}}_n$ with lowest $d\left( \boldsymbol{ \tilde{x}}_n, \boldsymbol{\hat{x}} \right)$ $\tikzmarknew{ml-end}$
+Output $\boldsymbol{\tilde{x}}_n$ with lowest $d\left( \boldsymbol{ \tilde{x}}_n, \boldsymbol{\hat{x}} \right)$ $\tikzbracemark{ml-end}$
         \end{algorithm}
 
     \AddNote{prox-start}{prox-end}{prox-start}{\small Proximal\\Decoding}