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

Emmanuel Abbe

doi:10.1109/TIT.2015.2410253

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

Emmanuel Abbe

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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 take the original arbitrary dependencies to extremal dependencies. Polar coding schemes for the Slepian-Wolf (SW) coding problem and for secret key generations are then proposed based on this phenomenon. In particular, secret keys achieving the secrecy capacity and compression schemes achieving the SW capacity region are obtained with a complexity of O(n log (n)).

Original language	English (US)
Article number	7055362
Pages (from-to)	2388-2398
Number of pages	11
Journal	IEEE Transactions on Information Theory
Volume	61
Issue number	5
DOIs	https://doi.org/10.1109/TIT.2015.2410253
State	Published - May 1 2015

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Keywords

Polar codes
polarization
randomness extraction

Access to Document

10.1109/TIT.2015.2410253

Cite this

@article{dc45e948148a49169516ac5da145202d,

title = "Randomness and Dependencies Extraction via Polarization, With Applications to Slepian-Wolf Coding and Secrecy",

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 take the original arbitrary dependencies to extremal dependencies. Polar coding schemes for the Slepian-Wolf (SW) coding problem and for secret key generations are then proposed based on this phenomenon. In particular, secret keys achieving the secrecy capacity and compression schemes achieving the SW capacity region are obtained with a complexity of O(n log (n)).",

keywords = "Polar codes, polarization, randomness extraction",

author = "Emmanuel Abbe",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2015",

month = may,

day = "1",

doi = "10.1109/TIT.2015.2410253",

language = "English (US)",

volume = "61",

pages = "2388--2398",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

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

AU - Abbe, Emmanuel

PY - 2015/5/1

Y1 - 2015/5/1

N2 - 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 take the original arbitrary dependencies to extremal dependencies. Polar coding schemes for the Slepian-Wolf (SW) coding problem and for secret key generations are then proposed based on this phenomenon. In particular, secret keys achieving the secrecy capacity and compression schemes achieving the SW capacity region are obtained with a complexity of O(n log (n)).

AB - 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 take the original arbitrary dependencies to extremal dependencies. Polar coding schemes for the Slepian-Wolf (SW) coding problem and for secret key generations are then proposed based on this phenomenon. In particular, secret keys achieving the secrecy capacity and compression schemes achieving the SW capacity region are obtained with a complexity of O(n log (n)).

KW - Polar codes

KW - polarization

KW - randomness extraction

UR - http://www.scopus.com/inward/record.url?scp=84928612846&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84928612846&partnerID=8YFLogxK

U2 - 10.1109/TIT.2015.2410253

DO - 10.1109/TIT.2015.2410253

M3 - Article

AN - SCOPUS:84928612846

SN - 0018-9448

VL - 61

SP - 2388

EP - 2398

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

M1 - 7055362

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this