Secure Multiplex Coding with a Common Message

Details Secure Multiplex Coding with a Common Message Secure Multiplex Coding with a Common Message

2011-01-20

arxiv.org/abs/1101.4036v3

Proc. 2011 IEEE ISIT, pp. 1965-1969, Saint Petersburg, Russia, July 31-August 5, 2011

Computer Science

Information Theory

5 pages, no figure, IEEEtran.sty, final version to appear in Proc. ISIT 2011

Scientific paper

10.1109/ISIT.2011.6033896

We determine the capacity region of the secure multiplex coding with a common
message, and evaluate the mutual information and the equivocation rate of a
collection of secret messages to the second receiver (eavesdropper), which were
not evaluated by Yamamoto et al.

Affiliated with

Also associated with

No associations

Rating

Secure Multiplex Coding with a Common Message 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 with a Common Message, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Multiplex Coding with a Common Message will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-18428