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

Minor edits

Browse Source
This commit is contained in:
Mark
2024-04-21 21:26:19 -07:00
parent 311f09f00e
commit 8ba834de59
3 changed files with 125 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -88,6 +88,15 @@ We'll encode our string into a sequence of 6-bit blocks, interpreted as follows:
So, the sequence \texttt{BBB} will be encoded as \texttt{[0011-01]}. \par
\note[Notation]{Just like spaces, dashes in a binary blob are added for readability.}
\remark{Notation}
In this handout, encoded binary blobs will always be written in square brackets. \par
Ignore spaces and dashes, they are provided for convenience. \par
For example, the binary sequences \texttt{[000 011 100 001 010 100]} and \texttt{[000011100001010100]} \par
are identical. The first, however, is easier to read.
\pagebreak
\problem{}
Encode \texttt{AAAA$\cdot$AAAA$\cdot$BCD$\cdot$AAAA$\cdot$AAAA} using this scheme. \par
Is this more or less efficient than \ref{runlenone}?
@ -98,7 +107,7 @@ Is this more or less efficient than \ref{runlenone}?
\end{solution}
\vfill
\pagebreak
\problem{}
Is run-length coding always efficient? When does it work well, and when does it fail?