One-way communication and error-correcting codes

We establish a further connection between one-way communication where a sender conveys information to a receiver who has related information, and error-correction coding where a sender attempts to communicate reliably over a noisy channel. We use this connection to derive three results on the two problems. An often-tight lower bound on the number of bits required for one-way communication based on the largest code for the corresponding error-correction problem. A proof that one-way communication is suboptimal for a large class of Hamming-distance problems. And an error-correcting code whose minimum distance properties are similar to those of BCH codes.