@inproceedings{bf330706df32409593494f800b3ba49d,
title = "Soft-covering via Constant-composition Superposition codes",
abstract = "We consider the problem of soft-covering with constant composition superposition codes and characterize the optimal soft-covering exponent. A double-exponential concentration bound for deviation of the exponent from its mean is also established. We demonstrate an application of the result to achieving the secrecy-capacity region of a broadcast channel with confidential messages under a per-codeword cost constraint. This generalizes the recent characterization of the wiretap channel secrecy-capacity under an average cost constraint, highlighting the potential utility of the superposition soft-covering result to the analysis of coding problems.",
author = "Sreejith Sreekumar and Ziv Goldfeld",
note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 2021 IEEE International Symposium on Information Theory, ISIT 2021 ; Conference date: 12-07-2021 Through 20-07-2021",
year = "2021",
month = jul,
day = "12",
doi = "10.1109/ISIT45174.2021.9518258",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers",
pages = "2876--2881",
booktitle = "2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings",
address = "United States",
}