5 citations · 7 across the 3 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2014
Exact Common Information
Gowtham Ramani Kumar, Cheuk Ting Li, Abbas El Gamal
This paper introduces the notion of exact common information, which is the minimum description length of the common randomness needed for the exact distributed generation of two co…
cs.IT2013★ 5 cited
Which Boolean Functions are Most Informative?
Gowtham R. Kumar, Thomas A. Courtade
We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let be i.i.d. Bernoulli(1/2),…
cs.IT2012★ 2 cited
No input symbol should occur more frequently than 1-1/e
Gowtham Kumar, Alexandros Manolakos
Consider any discrete memoryless channel (DMC) with arbitrarily but finite input and output alphabets X, Y respectively. Then, for any capacity achieving input distribution all sym…