Next Article in Journal
Rate-Distortion Region of a Gray–Wyner Model with Side Information
Next Article in Special Issue
Secure and Reliable Key Agreement with Physical Unclonable Functions
Previous Article in Journal
Non-Equilibrium Relations for Bounded Rational Decision-Making in Changing Environments
Previous Article in Special Issue
Compressed Secret Key Agreement:Maximizing Multivariate Mutual Information per Bit
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle
Entropy 2018, 20(1), 3; https://doi.org/10.3390/e20010003

Polar Codes for Covert Communications over Asynchronous Discrete Memoryless Channels

1
UMI 2958 Georgia Tech-CNRS, 57070 Metz, France
2
School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA
3
CentraleSupélec, 57070 Metz, France
*
Author to whom correspondence should be addressed.
Received: 7 August 2017 / Revised: 14 November 2017 / Accepted: 14 November 2017 / Published: 22 December 2017
(This article belongs to the Special Issue Information-Theoretic Security)
View Full-Text   |   Download PDF [525 KB, uploaded 22 December 2017]   |  

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. View Full-Text
Keywords: physical-layer security; covert communication; polar codes physical-layer security; covert communication; polar codes
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Supplementary material

SciFeed

Share & Cite This Article

MDPI and ACS Style

Frèche, G.; Bloch, M.R.; Barret, M. Polar Codes for Covert Communications over Asynchronous Discrete Memoryless Channels. Entropy 2018, 20, 3.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top