Lecture 17: Proof of a geomretic lemma

Today we finished the proof of the claim about the existence of a map with special properties and the geometric lemma that were used to prove the Plotkin bound in the last lecture. We then briefly looked at the setup for the Johnson bound, which we will state and prove in the next lecture (and use it to prove another tradeoff between rate and distance for codes).