2000 character limit reached
Secure Multiplex Coding with a Common Message
Published 20 Jan 2011 in cs.IT, cs.CR, and math.IT | (1101.4036v3)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.