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