In the information dissemination problem, $n$ parties each hold a unique piece of information and wish to learn all the information. They communicate over an adversarial broadcast channel, where an adversary may corrupt a fraction of the received transmissions. What is the largest fraction of errors to which an information ... more >>>