MDS codes on the erasure-erasure wiretap channel

This paper considers the problem of perfectly secure communication on a modified version of Wyner's wiretap channel II where both the main and wiretapper's channels have some erasures. A secret message is to be encoded into $n$ channel symbols and transmitted. The main channel is such that the legitimate receiver receives the transmitted codeword with exactly $n - \nu$ erasures, where the positions of the erasures are random. Additionally, an eavesdropper (wire-tapper) is able to observe the transmitted codeword with $n - \mu$ erasures in a similar fashion. This paper studies the maximum achievable information rate with perfect secrecy on this channel and gives a coding scheme using nested codes that achieves the secrecy capacity.

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

[2]  Shlomo Shamai,et al.  Nested Linear/Lattice Codes for Structured , 2002 .

[3]  I. G. Núñez,et al.  Generalized Hamming Weights for Linear Codes , 2001 .

[4]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

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

[6]  Victor K.-W. Wei,et al.  Generalized Hamming weights for linear codes , 1991, IEEE Trans. Inf. Theory.

[7]  Kefei Chen,et al.  Some new characters on the wire-tap channel of type II , 2005, IEEE Transactions on Information Theory.

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

[9]  G. David Forney,et al.  Dimension/length profiles and trellis complexity of linear block codes , 1994, IEEE Trans. Inf. Theory.