Mark/handouts
1
0
Fork 0
Code Pull Requests 1 Actions Packages Releases Activity

Finished compression handout

Browse Source
This commit is contained in:
Mark
2024-04-25 14:59:29 -07:00
parent 0bfe54d69b
commit 237497c0c3
6 changed files with 52 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
Advanced/Compression/parts/1 runlength.tex
View File

@ -35,7 +35,7 @@
\problem{}<runlenone>
Using a na\"ive coding scheme, encode \texttt{AAAA$\cdot$AAAA$\cdot$BCD$\cdot$AAAA$\cdot$AAAA} in binary. \par
Using the na\"ive coding scheme, encode \texttt{AAAA$\cdot$AAAA$\cdot$BCD$\cdot$AAAA$\cdot$AAAA} in binary. \par
\note[Note]{
We're still using the four-symbol alphabet $\{\texttt{A}, \texttt{B}, \texttt{C}, \texttt{D}\}$. \par
Dots ($\cdot$) in the string are drawn for readability. Ignore them.
@ -44,6 +44,11 @@ Using a na\"ive coding scheme, encode \texttt{AAAA$\cdot$AAAA$\cdot$BCD$\cdot$AA
\begin{solution}
There are eight \texttt{A}s on each end of that string. Mapping symbols as before, \par
we get \texttt{[00 00 00 00 00 00 00 00 01 10 11 00 00 00 00 00 00 00 00]}
\begin{instructornote}
In this handout, all encoded binary is written in square brackets. \par
Spaces, dashes, dots, and etc are added for readability, and should be ignored.
\end{instructornote}
\end{solution}