Covert Communication with Finite Blocklength in AWGN Channels

January 31, 2017 Β· Declared Dead Β· πŸ› 2017 IEEE International Conference on Communications (ICC)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shihao Yan, Biao He, Yirui Cong, Xiangyun Zhou arXiv ID 1701.08891 Category cs.IT: Information Theory Cross-listed cs.CR Citations 61 Venue 2017 IEEE International Conference on Communications (ICC) Last Checked 5 months ago
Abstract
Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication in AWGN channels with finite blocklength, in which the number of channel uses is finite. Specifically, we analytically prove that the entire block (all available channel uses) should be utilized to maximize the effective throughput of the transmission subject to a predetermined covert requirement. This is a nontrivial result because more channel uses results in more observations at the warden for detecting the transmission. We also determine the maximum allowable transmit power per channel use, which is shown to decrease as the blocklength increases. Despite the decrease in the maximum allowable transmit power per channel use, the maximum allowable total power over the entire block is proved to increase with the blocklength, which leads to the fact that the effective throughput increases with the blocklength.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted