A transmission strategy that allows the sender to deliver any of Mmessages to the receiver over a binary channel when at most e errors canoccur is presented. The total number of bits required by the strategydiffers from the known lower bound by 3e. This statement simultaneouslygives a new upper bound on the number of questions in the process ofsearching with lies known as the “Ulam's game”
展开▼
