Comparison of coding strategies for the block fading erasure wiretap channel

In this paper we study the block fading binary erasure wiretap channel, where the transmitter sends secret messages to a legitimate receiver over a block fading erasure channel in the presence of an eavesdropper. The eavesdropper receives the transmitted secret message over a separate block fading binary erasure channel. It is assumed that the transmitter knows the instantaneous channel state information (CSI) of the main channel and knows only the probability distribution of the capacity of the wiretap channel. We mainly consider the case where the transmitter adapts the code based on the CSI of the main channel in order to achieve either a certain secrecy rate or a certain level of secrecy. We compare the two proposed scenarios for the adaptive coding method based on the probability of secrecy outage and the average throughput.

[1]  Lawrence H. Ozarow,et al.  Wire-tap channel II , 1984, AT&T Bell Laboratories Technical Journal.

[2]  Martin Bossert,et al.  Channel Coding for Telecommunications , 1999 .

[3]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[4]  Miguel R. D. Rodrigues,et al.  Secrecy Capacity of Wireless Channels , 2006, 2006 IEEE International Symposium on Information Theory.

[5]  Ramanan Subramanian,et al.  Comparison of Equivocation Rate of Finite-Length Codes for the Wiretap Channel , 2013 .

[6]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[7]  Mikael Skoglund,et al.  Two edge type LDPC codes for the wiretap channel , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[8]  A. Robert Calderbank,et al.  Applications of LDPC Codes to the Wiretap Channel , 2004, IEEE Transactions on Information Theory.