{
  "id": "1508.01602",
  "version": "v1",
  "published": "2015-08-07T04:49:16.000Z",
  "updated": "2015-08-07T04:49:16.000Z",
  "title": "A Stronger Soft-Covering Lemma and Applications",
  "authors": [
    "Paul Cuff"
  ],
  "comment": "IEEE CNS 2015, 2nd Workshop on Physical-layer Methods for Wireless Security, 4 pages",
  "categories": [
    "cs.IT",
    "math.IT"
  ],
  "abstract": "Wyner's soft-covering lemma is a valuable tool for achievability proofs of information theoretic security, resolvability, channel synthesis, and source coding. The result herein sharpens the claim of soft-covering by moving away from an expected value analysis. Instead, a random codebook is shown to achieve the soft-covering phenomenon with high probability. The probability of failure is doubly-exponentially small in the block-length, enabling more powerful applications through the union bound.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-08-07T04:49:16.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "94A15",
      "H.1.1"
    ],
    "keywords": [
      "stronger soft-covering lemma",
      "applications",
      "information theoretic security",
      "expected value analysis",
      "channel synthesis"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150801602C"
    }
  }
}