Polar codes for covert communications over asynchronous discrete memoryless channels

18Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

This paper introduces an explicit covert communication code for binary-input asynchronous discrete memoryless channels based on binary polar codes, in which legitimate parties exploit uncertainty created by both the channel noise and the time of transmission to avoid detection by an adversary. The proposed code jointly ensures reliable communication for a legitimate receiver and low probability of detection with respect to the adversary, both observing noisy versions of the codewords. Binary polar codes are used to shape the weight distribution of codewords and ensure that the average weight decays as the block length grows. The performance of the proposed code is severely limited by the speed of polarization, which in turn controls the decay of the average codeword weight with the block length. Although the proposed construction falls largely short of achieving the performance of random codes, it inherits the low-complexity properties of polar codes.

Cite

CITATION STYLE

APA

Frèche, G., Bloch, M. R., & Barret, M. (2018). Polar codes for covert communications over asynchronous discrete memoryless channels. Entropy, 20(1). https://doi.org/10.3390/e20010003

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free