Title

One-shot achievability and converse bounds of Gaussian random coding in AWGN channels under covert constraint

Document Type

Conference Proceeding

Publication Date

9-1-2019

Abstract

The achievability and converse bounds on the throughput of covert communication over AWGN channels are investigated in this paper. By re-visiting [8], several new achievability bounds on maximal and average probability of error based on random coding scheme are presented, which leads to results on achievability bounds when the codewords are generated from Gaussian distribution and then selected from a subset under maximal power constraint. The bounds provide us the framework for analyzing the maximal throughput under covert constraint of total variation distance.

Publication Source (Journal or Book title)

2019 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019

First Page

1082

Last Page

1089

This document is currently not available here.

Share

COinS