Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy

DOI10.1109/TIT.2015.2410253MaRDI QIDQ2978613zbMATH OpenOpenAlexFDO

Authors Emmanuel Abbe

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.1247

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

Abstract: The polarization phenomenon for a single source is extended to a framework with multiple correlated sources. It is shown in addition to extracting the randomness of the source, the polar transforms takes the original arbitrary dependencies to extremal dependencies. Polar coding schemes for the Slepian-Wolf problem and for secret key generations are then proposed based on this phenomenon. In particular, constructions of secret keys achieving the secrecy capacity and compression schemes achieving the Slepian-Wolf capacity region are obtained with a complexity of $O(nlog(n))$.

Recommendations

• Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
• Exact Random Coding Secrecy Exponents for the Wiretap Channel
• Almost independence of random variables and capacity of a secrecy channel
• Statistical randomized encodings: a complexity theoretic view
• Semidefinite programs for randomness extractors
• Extracting randomness: A survey and new constructions
• Randomness and structure in channel coding
• Polar Coding for Secret-Key Generation
• Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
• Randomness extractors -- applications and constructions

This page was built for publication: Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2978613)