Information Indivisibility Results

We derive a theorem stating that it is not possible to generate two independent observations of a binary random variable such that each observation gives only partial information about the binary variable, but the two observations jointly determine the binary variable exactly. We illustrate this theorem with examples and elaborate on applications of the theorem to cryptography and to determining the EXIT function of a zero-error code.