Strong Functional Representation Lemma and Applications to Coding Theorems.

This paper shows that for any random variables X and Y, it is possible to represent Y as a function of (X, Z) such that Z is independent of X and I(X; Z|Y) ≤ log(I(X; Y)+1)+4 bits. We use this strong functional representation lemma (SFRL) to establish a bound on the rate needed for one-shot exact channel simulation for general (discrete or continuous) random variables, strengthening the results by...