Move figures in chapter 3 inbetween text

src/thesis/chapters/2_fundamentals.tex

@@ -99,7 +99,7 @@ prompting us to define the \ac{pcm} as $\bm{H} \in
 The \textit{syndrome} $\bm{s} = \bm{H} \bm{v}^\text{T}$ describes
 which parity checks a candidate codeword $\bm{v} \in \mathbb{F}_2^n$ violates.
 The representation using the \ac{pcm} has the benefit of providing a
-description of the code, the memory complexity of which doesn't grow
+description of the code, the memory complexity of which does not grow
 exponentially with $n$, in contrast to keeping track of all codewords directly.
 
 %