2000 character limit reached
On the Correlation between Boolean Functions of Sequences of Random Variables
Published 4 Feb 2017 in cs.IT and math.IT | (1702.01353v1)
Abstract: In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a new upper-bound on the correlation between the outputs of these functions. The upper-bound is useful in various disciplines which deal with common-information. We build upon Witsenhausen's bound on maximum-correlation. The previous upper-bound did not take the effective length of the Boolean functions into account.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.