diff --git a/notes/ANS Theory.md b/notes/ANS Theory.md
index b8d8a79..1c368b7 100644
--- a/notes/ANS Theory.md	
+++ b/notes/ANS Theory.md	
@@ -44,3 +44,6 @@ The decoding process performs the same series of steps, but by asking a question
 1. Is the value between $0.00$ and $0.50$? If so, the first coin flip resulted in *Tails*. Otherwise if the value is between $0.50$ and $1.00$, the first coin flip resulted in *Heads*. 
 The above process can be repeated just like the encoding process until we've determined the result of the first three coin flips.
 
+These subdivisions can be encoded using $0$ and $1$, where $0$ represents the bottom half of the range, and $1$ represents the top half of the range. 
+
+When the alphabet is large enough that you can't select a particular outcome using one bit, multiple bits can be used instead to divide up and down the range.
\ No newline at end of file