Secure Multiplex Coding with a Common Message
classification
💻 cs.IT
cs.CRmath.IT
keywords
codingcommonmessagemultiplexsecurecapacitycollectiondetermine
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.