Gray–Wyner conjecture for the doubly symmetric binary source

From papers

Let (X,Y)(X,Y) be a doubly symmetric binary source DSBS(p){\mathrm{DSBS}}(p) with p(0,1/2)p\in(0,1/2). Let R(D1,D2)R(D_{1},D_{2}) denote its rate-distortion function under Hamming distortion, let hh be the binary entropy function, and let R0(R1,R2)R_{0}(R_{1},R_{2}) be the minimum common rate in the Gray–Wyner coding system when the private rates are (R1,R2)(R_{1},R_{2}). Gray–Wyner conjecture. For every (R1,R2)[0,1]2(R_{1},R_{2})\in[0,1]^{2},

R0(R1,R2)=R(h1(R1),h1(R2)).R_{0}(R_{1},R_{2})=R(h^{-1}(R_{1}),h^{-1}(R_{2})).

Equivalently, the layered coding scheme that first uses an optimal point-to-point lossy compression code with distortions (D1,D2)(D_{1},D_{2}) and then losslessly compresses the residuals at rates h(D1)h(D_{1}) and h(D2)h(D_{2}) should be optimal for the Gray–Wyner system for the DSBS. The conjecture has been open since 1974, with the source stating that no progress had been made on it at the time of publication.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Lei Yu, “Gray–Wyner and Mutual Information Regions for Doubly Symmetric Binary Sources and Gaussian Sources”, arXiv:2212.14696 (2023).

Solutions 0

No solutions have been posted yet.