diff options
| author | Philipp Le <philipp@philipple.de> | 2022-06-10 22:34:20 +0200 |
|---|---|---|
| committer | Philipp Le <philipp@philipple.de> | 2022-06-10 22:46:53 +0200 |
| commit | fc0792c78c25bf18a88b952784effc024fcea334 (patch) | |
| tree | c4fbddd8850c3234a88fff572a3175a228a073c1 | |
| parent | 9f618c793a76e4199d69eca5ef802fdb7492ffdf (diff) | |
| download | dcs-lecture-notes-fc0792c78c25bf18a88b952784effc024fcea334.zip dcs-lecture-notes-fc0792c78c25bf18a88b952784effc024fcea334.tar.gz dcs-lecture-notes-fc0792c78c25bf18a88b952784effc024fcea334.tar.bz2 | |
Typo fix in chapter 8
| -rw-r--r-- | chapter08/content_ch08.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/chapter08/content_ch08.tex b/chapter08/content_ch08.tex index 35296e7..de6f9e8 100644 --- a/chapter08/content_ch08.tex +++ b/chapter08/content_ch08.tex @@ -508,7 +508,7 @@ The steps are: \end{enumerate} \begin{example}{Shannon-Fano binary coding of a discrete memory less source} - A input source alphabet has the symbols $s_1 = (00)_2$, $s_2 = (01)_2$, $s_3 = (10)_2$ and $s_4 = (1)_2$ with the following probabilities: + A input source alphabet has the symbols $s_1 = (00)_2$, $s_2 = (01)_2$, $s_3 = (10)_2$ and $s_4 = (11)_2$ with the following probabilities: \begin{table}[H] \centering \begin{tabular}{|l|l|l|l|l|} |