PROJECT TITLE :
Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
We tend to develop an occasional-complexity polar coding theme for the discrete memoryless broadcast channel with confidential messages under robust secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform randomness within the stochastic encoder, and avoiding assumptions regarding the symmetry or degraded nature of the channels. The worth procured these extensions is that the encoder and the decoders are required to share a secret seed of negligible size and to extend the block length through chaining. We have a tendency to conjointly highlight a shut conceptual connection between the proposed polar coding theme and a random binning proof of the secrecy capacity region.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here