Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
Authors:
Top Cited Papers
- 7 March 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 62 (5) , 2410-2429
Abstract
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 channels. The price paid for these extensions is that the encoder and the decoders are required to share a secret seed of negligible size and to increase the block length through chaining. We also highlight a close conceptual connection between the proposed polar coding scheme and a random binning proof of the secrecy capacity region.Keywords
All Related Versions
Funding Information
- NSF (CCF 1320298)
- ANR (13-BS03-0008)
This publication has 34 references indexed in Scilit:
- Polar Codes for Broadcast ChannelsIEEE Transactions on Information Theory, 2014
- Polar coding for secret-key generation2013
- Data compression with nearly uniform output2013
- Semantic Security for the Wiretap Channel2012
- Polar Codes are Optimal for Lossy Source CodingIEEE Transactions on Information Theory, 2010
- Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic RandomnessIEEE Transactions on Information Theory, 2008
- Folklore in Source Coding: Information-Spectrum ApproachIEEE Transactions on Information Theory, 2005
- Elements of Information Theory2001
- Interval algorithm for random number generationIEEE Transactions on Information Theory, 1997
- Random walks on finite groups and rapidly mixing markov chains1983