Guillaume Frèche

Articles

1. G. Frèche, M. Bloch, and M. Barret, “Polar Codes for Covert Communications over Asynchronous Discrete Memoryless Channels,” Entropy, vol. 20, no. 1, p. 3, Dec. 2017.

   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.

   @article{Freche2017, author = {Fr\`eche, Guillaume and Bloch, Matthieu and Barret, Michel}, title = {Polar Codes for Covert Communications over Asynchronous Discrete Memoryless Channels}, journal = {Entropy}, year = {2017}, volume = {20}, number = {1}, pages = {3}, month = dec, issn = {1099-4300}, doi = {10.3390/e20010003}, file = {:2017-Freche-Entropy.pdf:PDF}, groups = {Steganography and covert communications, Polar codes} }

Conference proceedings

1. G. Frèche, M. R. Bloch, and M. Barret, “Polar codes for covert communications over asynchronous Discrete Memoryless Channels,” in Proc. of 51st Annual Conference on Information Sciences and Systems, Baltimore, MD, Mar. 2017, pp. 1–1.

   We develop a covert communication scheme 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. The proposed code jointly ensures reliable communication for a legitimate receiver and low probability of detection with respect to an 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 limited by the speed of polarization, which in turns controls the decay of the average codeword weight with the block length. Although the proposed construction falls short of achieving the performance of random codes, it inherits the low-complexity properties of polar codes.

   @inproceedings{Freche2017a, author = {Fr\`eche, Guillaume and Bloch, Matthieu R. and Barret, Michel}, booktitle = {Proc. of 51st Annual Conference on Information Sciences and Systems}, title = {Polar codes for covert communications over asynchronous Discrete Memoryless Channels}, year = {2017}, address = {Baltimore, MD}, month = mar, pages = {1-1}, creationdate = {2017-08-30T00:00:00}, doi = {10.1109/CISS.2017.7926132}, groups = {Steganography and covert communications, Polar codes}, keywords = {Memoryless systems;Noise measurement;Receivers;Reliability;Shape;Uncertainty}, owner = {mattbloch} }