Parity construction of pairwise independent bits

ID: parity-construction-of-pairwise-independent-bits

The parity construction of pairwise independent bits turns two independent fair bits into three pairwise independent random variables. With , , and , their allowed triples are , each of probability . Every coordinate has the Bernoulli distribution with parameter . Every pair has the same joint probability mass function:
All twelve pair cells equal the product of the corresponding probabilities in their marginal distributions. This establishes pairwise independent random variables, a requirement involving every pair of value-events, rather than merely one chosen event per coordinate. For general real-valued random variables , the requirement is
for every pair of Borel sets . For these binary random variables, checking all four cells of each pair suffices: any value-event is a union of the checked cells. In fact, for binary random variables, independence of their one-value events also gives the other cells by taking complements. Siegrist gives the all-set definition and its connection to indicator random variables in Random Services: independence of random variables.
The full joint probability mass function tells a different story:
The integer parity of is always even. Any two bits determine the third: , , and . Each coordinate is independent of either other coordinate individually, but is dependent on the pair together. For example, the conditional probabilities satisfy and . See also pairwise independence does not imply joint independence for the general distinction.
The constraint changes the sum's probability distribution without changing its expected value or variance. Let . Only gives ; each other allowed triple gives . Direct calculation gives
The same variance follows from the variance of a sum: each Bernoulli distribution has variance , and pairwise independent random variables have zero cross covariances. Linearity of expectation gives the expected value even without independence.
For comparison, the sum of three mutually independent fair bits has the binomial distribution :
Both sums have identical expected values and variances, but never takes the values one or three. Even their third moments differ: , whereas . Pairwise independence preserves these first two sum summaries while allowing a different joint probability distribution and a different sum law. The calculation is an exact finite example.
Figure 1.
Pairwise independence preserves the mean and variance but changes the sum distribution
. The parity construction of pairwise independent bits gives sum probabilities ; three mutually independent fair bits give the binomial distribution probabilities . Both expected values are and both variances are . Details.

New to topics? Read the docs here!