pith. sign in

arxiv: 0812.3873 · v1 · submitted 2008-12-19 · 💻 cs.IT · math.IT

The K-Receiver Broadcast Channel with Confidential Messages

classification 💻 cs.IT math.IT
keywords k-receiverwiretapperbroadcastchannelcommonconfidentialexternalmessage
0
0 comments X
read the original abstract

The secrecy capacity region for the K-receiver degraded broadcast channel (BC) is given for confidential messages sent to the receivers and to be kept secret from an external wiretapper. Superposition coding and Wyner's random code partitioning are used to show the achievable rate tuples. Error probability analysis and equivocation calculation are also provided. In the converse proof, a new definition for the auxiliary random variables is used, which is different from either the case of the 2-receiver BC without common message or the K-receiver BC with common message, both with an external wiretapper; or the K-receiver BC without a wiretapper.

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.