Sharp Bounds for Mutual Covering
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2019.2919720
Abstract: A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables; among a given number of independently generated candidates, falling within a… read more here.
Keywords: covering lemma; mutual covering; joint distribution; probability ... See more keywords
The Besicovitch covering lemma and maximal functions
Sign Up to like & getrecommendations! Published in 2019 at "Rocky Mountain Journal of Mathematics"
DOI: 10.1216/rmj-2019-49-2-539
Abstract: This paper has two purposes. First, we explain and describe the Besicovitch covering lemma, and we provide a new proof. Applications are given, particularly to the ideas of Nagel and Stein about Fatou theorems through… read more here.
Keywords: besicovitch covering; maximal functions; covering lemma; lemma maximal ... See more keywords