Coding theory
How much information can a robust code contain?
A communication system adds redundancy so a damaged message can still be recognized. The codewords must remain sufficiently different. How many distinguishable messages fit when every pair needs a minimum separation?
Formal proof reported↗