Suvarna Garge (Editor)

Shearer's inequality

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In information theory, Shearer's inequality, named after James Shearer, states that if X1, ..., Xd are random variables and S1, ..., Sn are subsets of {1, 2, ..., d} such that every integer between 1 and d lies in at least r of these subsets, then

H [ ( X 1 , , X d ) ] 1 r i = 1 n H [ ( X j ) j S i ]

where ( X j ) j S i is the Cartesian product of random variables X j with indices j in S i (so the dimension of this vector is equal to the size of S i ).

References

Shearer's inequality Wikipedia


Similar Topics