Create a correctable code for a list of keywords. Your task is to create an efficient, correctable code for a list that contains 20 keywords. The words in your code will be represented as binary strings using only 0s and 1s. Stringent correctability requirements mean your code must have a minimum distance of 3.

- Create a code consisting of binary codewords. - The code must meet three requirements -- Contain at least 20 codewords -- Have a minimum distance of 3 (explain why a min distance of 4 is no better than 3) -- Maintain efficiency by using the fewest number of bits per codeword as possible - Clearly document and describe your code: what it is, why you chose it, etc. - Discuss how topology relates to the selection of your code and the Hamming metric

So, this is super confusing to me.