The Multivariate Covering Lemma and its Converse
Abstract
The multivariate covering lemma states that given a collection of k codebooks, each of sufficiently large cardinality and independently generated according to one of the marginals of a joint distribution, one can always choose one codeword from each codebook such that the resulting k-tuple of codewords is jointly typical with respect to the joint distribution. We give a proof of this lemma for weakly typical sets. This allows achievability proofs that rely on the covering lemma to go through for continuous channels (e.g., Gaussian) without the need for quantization. The covering lemma and its converse are widely used in information theory, including in rate-distortion theory and in achievability results for multi-user channels.
Attached Files
Submitted - 1508.03349.pdf
Files
Name | Size | Download all |
---|---|---|
md5:1f2e09ec67c20d793689bbbff60058d7
|
166.6 kB | Preview Download |
Additional details
- Eprint ID
- 94381
- Resolver ID
- CaltechAUTHORS:20190402-145646746
- Created
-
2019-04-02Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field