-If every length-20 bitstring in the world has equal probability, this can't be done: there are 2<sup>20</sup> (= 1,048,576) length-20 strings and only 2<sup>5</sup> (= 32) length-5 codewords; there aren't enough codewords to go around to cover all the strings in this world. It's worse than that: if every length-20 bitstring in the world has equal probability, you can't have labels that compress information _at all_: if you said that the first 19 bits of something you saw in the world were `0110000111011000001`, the people listening to you would be completely clueless as to whether the whole thing was `0110000111011000001`**`0`** or `0110000111011000001`**`1`**. _Locating_ a book in the [Jose Luis Borges's Library of Babel](TODO: linky and accents) is mathematically equivalent to writing it yourself.
+If every length-20 bitstring in the world has equal probability, this can't be done: there are 2<sup>20</sup> (= 1,048,576) length-20 strings and only 2<sup>5</sup> (= 32) length-5 codewords; there aren't enough codewords to go around to cover all the strings in this world. It's worse than that: if every length-20 bitstring in the world has equal probability, you can't have labels that compress information _at all_: if you said that the first 19 bits of something you saw in the world were `0110000111011000001`, the people listening to you would be completely clueless as to whether the whole thing was `0110000111011000001`**`0`** or `0110000111011000001`**`1`**. _Locating_ a book in the [Jose Luis Borges's Library of Babel](https://en.wikipedia.org/wiki/The_Library_of_Babel) is mathematically equivalent to writing it yourself.