Secure Multiplex Coding with a Common Message

TL;DR

This paper establishes the capacity region for secure multiplex coding with a common message and evaluates the mutual information and equivocation rate of secret messages against an eavesdropper.

Contribution

It provides the first complete characterization of the capacity region and secrecy metrics for this coding scenario, extending prior work by Yamamoto et al.

Findings

Capacity region explicitly determined

Mutual information and equivocation rates evaluated

Enhanced understanding of security in multiplex coding

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.