Secure multiplex coding to attain the channel capacity in wiretap channels

Details Secure multiplex coding to attain the channel capacity in wiretap channels Secure multiplex coding to attain the channel capacity in wiretap channels

2005-09-16

arxiv.org/abs/cs/0509047v1

Computer Science

Information Theory

15 pages, submitted to the IEEE Transactions on Information Theory

Scientific paper

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity $C_S$, which is usually smaller than the channel capacity $C$. In order to remove the loss $C - C_S$, we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multiplex coding scheme can attain the channel capacity as the total rate of the plural messages and the perfect secrecy for each message. The coding theorem is proved by extending Hayashi's proof, in which the coding of the channel resolvability is applied to wiretap channels.

Affiliated with

Also associated with

No associations

Rating

Secure multiplex coding to attain the channel capacity in wiretap channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure multiplex coding to attain the channel capacity in wiretap channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure multiplex coding to attain the channel capacity in wiretap channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-553021