All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD6-S7-T1.2
Paper Title Soft-covering via Constant-composition Superposition codes
Authors Sreejith Sreekumar, Ziv Goldfeld, Cornell University, United States
Session D6-S7-T1: Broadcast Channels
Chaired Session: Tuesday, 20 July, 00:00 - 00:20
Engagement Session: Tuesday, 20 July, 00:20 - 00:40
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.