Fix typos

2025-01-19 20:24:51 -08:00
parent cb2a1d99dd
commit 5f8c54650f
30 changed files with 105 additions and 49 deletions
--- a/Advanced/Compression/parts/2
+++ b/Advanced/Compression/parts/2
@ -35,7 +35,9 @@ Then, decode the following:

 \begin{solution}

+	% spell:off
 	\texttt{ABCD$\cdot$ABCD$\cdot$BABABA$\cdot$ABCD$\cdot$ABCD} becomes \texttt{[ABCD<4, 4> BA<2,4> ABCD<4,4>]}.
+	% spell:on

 	\linehack{}

--- a/Advanced/Compression/parts/3
+++ b/Advanced/Compression/parts/3
@ -256,7 +256,8 @@ Now, do the opposite: draw a tree that encodes \texttt{DEACBDD} \textit{less} ef

 \remark{}
 As we just saw, constructing a prefix-free code is fairly easy. \par
-Constucting the \textit{most efficient} prefix-free code for a given message is a bit more difficult. \par
+Constructing the \textit{most efficient} prefix-free code for a
+given message is a bit more difficult. \par
 \pagebreak