3 papers
cs.IT2023
Bounds on Guessing Numbers and Secret Sharing Combining Information Theory Methods
Emirhan Gürpınar
This paper is on developing some computer-assisted proof methods involving non-classical inequalities for Shannon entropy. Two areas of the applications of information inequalities…
cs.IT2020
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
Emirhan Gürpınar, Andrei Romashchenko
It is known that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings x and y is equal to the length of the longest shared secret key that two part…
cs.DS2019
Tight Approximation Bounds for Maximum Multi-Coverage
Siddharth Barman, Omar Fawzi, Suprovat Ghoshal +1
In the classic maximum coverage problem, we are given subsets of a universe along with an integer and the objective is to find a subset $S \subseteq [m]…