to get very close to that I should we get to the optimal one okay so the efficient method to find the optimal one without needing to do that exhaustive search I just described is something called Huffman codes and right now but we'll cover how Huffman codes work procedurally and then later once we've seen a bit more foundation on information theory we will also prove the fact that they are optimal but for now we're not going to yet prove that there are more you're going to look at the procedure okay so how does it work