Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform randomness in the stochastic encoder, and avoiding assumptions regarding the symmetry or degraded nature of the …