Empirical and Strong Coordination via Soft Covering With Polar Codes

Chou, Remi A.; Bloch, Matthieu R.; Kliewer, Joerg

doi:10.1109/tit.2018.2817519

Cited by 21 publications

(31 citation statements)

References 46 publications

(106 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Perhaps surprisingly, we show that this is not the case and that codes may be designed for fixed channels; this is particularly convenient as it allows us to exploit families of channel capacity-and channel resolvability-achieving codes, such as polar codes [15], [17].…”

Section: A Setup For Mlc With Ppmmentioning

confidence: 96%

Multilevel-Coded Pulse-Position Modulation for Covert Communications

Kadampot¹,

Tahmasbi²,

Bloch³

2018

2018 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

We develop a low-complexity coding scheme to achieve covert communications over binary-input discrete memoryless channels (BI-DMCs). We circumvent the impossibility of covert communication with linear codes by introducing non-linearity through the use of pulse position modulation (PPM) and multilevel coding (MLC). We show that the MLC-PPM scheme exhibits many appealing properties; in particular, the channel at a given index level remains stationary as the number of level increases, which allows one to use families of channel capacity-and channel resolvability-achieving codes to concretely instantiate the covert communication scheme.A small misconception: One might think that linear codes might not be covert because the linearity constraint requires the sum of codewords to be a codeword; consequently, linear combinations of low-weight codewords would result in a codeword with high weight. This is, however, insufficient to argue that linear codes cannot be covert. In fact, one could consider a systematic code with unit-weight codewords in the generator matrix, i.e, G = ( I k 0 k×n−k ), where I k is the identity matrix of size k. All codewords of this code have weight at most k. Of course, this code would hardly be covert, mainly because the structure of the generator matrix allows an attacker to dismiss the last n − k codeword components. The next proposition formalizes this.Proposition 1. Consider an (n, k) binary linear code with (n, k) ∈ (N * ) 2 , n k. Assume that the code is used for communication over a BI-DMC (X , W Z|X , Z) with uniformly distributed messages. There exists a binary hypothesis test with false alarm probability α and missed-detection probability β such that

show abstract

Section: A Setup For Mlc With Ppmmentioning

confidence: 96%

Multilevel-Coded Pulse-Position Modulation for Covert Communications

Kadampot¹,

Tahmasbi²,

Bloch³

2018

2018 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…We note that polar codes have already been proposed for coordination in other settings: [19] proposes polar coding schemes for point-to-point empirical coordination with error free links and uniform actions, while [21] generalizes the polar coding scheme to the case of non uniform actions. Polar coding for strong point-to-point coordination has been presented in [20,37]. In [22] the authors construct a joint coordination-channel polar coding scheme for strong coordination of actions.…”

Section: Polar Coding Schemes For Strong Coordination With No Stamentioning

confidence: 99%

Strong Coordination of Signals and Actions Over Noisy Channels With Two-Sided State Information

Cervia

Luzzi

Treust

et al. 2020

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

We consider a network of two nodes separated by a noisy channel with two-sided state information, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of non-causal encoding and decoding, we propose a joint source-channel coding scheme and develop inner and outer bounds for the strong coordination region. While the inner and outer bounds do not match in general, we provide a complete characterization of the strong coordination region in three particular cases: i) when the channel is perfect; ii) when the decoder is lossless; and iii) when the random variables of the channel are independent from the random variables of the source. Through the study of these special cases, we prove that the separation principle does not hold for joint source-channel strong coordination. Finally, in the absence of state information, we show that polar codes achieve the best known inner bound for the strong coordination region, which therefore offers a constructive alternative to random binning and coding proofs.

show abstract

“…The metric introduced by Wyner in [6] was later called weak secrecy and is given as the normalized mutual information rate under the assumption of uniform distribution p M [60] [59]. The weak security metric criterion was strengthened to strong secrecy by subsequent improvement of Wyner's model in [48] and coincides with the mutual information also with uniform distribution p M [58, Appendix D-C] [61] and is given as…”

Section: B Proposed Wiretap Channel Model For the Finite-length Regimementioning

confidence: 99%

Physical Layer Security for RF Satellite Channels in the Finite-Length Regime

Vázquez-Castro

Hayashi

2019

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

Secure communications is becoming increasingly relevant in the development of space technology. Well established cryptographic technology is already in place and is expected to continue to be so. On the other hand, information theoretical security emerges as a post-quantum versatile candidate to complement overall security strength. In order to prove such potential, performance analysis methods are needed that consider realistic legitimate and eavesdropper system assumptions and non-asymptotic coding lengths.In this paper we propose the design of secure radio frequency (RF) satellite links with realistic system assumptions. Our contribution is three-fold. First, we propose a wiretap channel model for the finite-length regime. The model includes an stochastic wiretap encoding method using existing practical linear error correcting codes and hash codes. Secrecy is provided with privacy amplification, for which the finite-length secrecy metric is given that upper bounds semantic secrecy. Second, we derive a novel RF (broadcast) satellite wiretap channel model that parameterizes the stochastic degraded channel around the legitimate channel, a necessary condition to enable secure communication. Finally, we show the design of a secure satellite physical layer and finite-length performance evaluation. In doing so, we define as sacrifice rate the fixed fraction of the overall coding rate budget for reliability that needs to be allocated to secrecy. Our methodology does not make use of channel side information of the eavesdropper, only assumes worst case system assumptions. We illustrate our proposed design method with numerical results using practical error correcting codes in current standards of satellite communication.

show abstract

Empirical and Strong Coordination via Soft Covering With Polar Codes

Cited by 21 publications

References 46 publications

Multilevel-Coded Pulse-Position Modulation for Covert Communications

Multilevel-Coded Pulse-Position Modulation for Covert Communications

Strong Coordination of Signals and Actions Over Noisy Channels With Two-Sided State Information

Physical Layer Security for RF Satellite Channels in the Finite-Length Regime

Contact Info

Product

Resources

About