Strong functional representation lemma and applications to coding theorems
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. We use this strong functional representation lemma (SFRL) to establish a tighter bound …