Slepian-Wolf Corner Rates

Problem

Return the achievable Slepian-Wolf rate pair [R1, R2] = [H(X|Y), H(Y)] in bits for the 2D joint distribution joint[x][y]. This corner point lets one encoder compress independently while the decoder uses the other sequence as side information.

Hint

Measure exactly one sequence and the decoder recovers the other at rate H(X|Y).

Test cases

case 1

in: [[[0.25,0.25],[0.25,0.25]]]

expected: [1,1]

case 2

in: [[[0.5,0],[0,0.5]]]

expected: [0,1]

case 3

in: [[[0.4,0.1],[0.2,0.3]]]

expected: [0.8754887502163469,0.9709505944546686]

case 4

in: [[[0.5,0.25],[0,0.25]]]

expected: [0.5,1]

Starter codePython

import math
def slepian_wolf_rates(joint):
    # Your code here
    pass

4 test cases · run your code against them in the editor