Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming

Remi A. Chou, Aylin Yener

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters. No degradation or symmetry assumptions are made on the channel. Our main result is that any rate pair known to be achievable with a random coding like proof, is also achievable with an explicit and low-complexity polar coding scheme. Moreover, if the rate pair is known to be achievable without time-sharing, then time-sharing is not needed in our polar coding scheme as well. Our proof technique relies on rate-splitting, which introduces two virtual transmitters, and cooperative jamming strategies implemented by these virtual transmitters. Specifically, our coding scheme combines point-to-point codes that either aim at secretly conveying a message to the legitimate receiver or at performing cooperative jamming. Each point-to-point code relies on block Markov encoding to be able to deal with an arbitrary channel and strong secrecy. Consequently, our coding scheme is the combination of inter-dependent block Markov constructions. We assess reliability and strong secrecy through a detailed analysis of the dependencies between the random variables involved in the scheme.

Original languageEnglish (US)
Article number8438560
Pages (from-to)7903-7921
Number of pages19
JournalIEEE Transactions on Information Theory
Volume64
Issue number12
DOIs
StatePublished - Dec 1 2018

Fingerprint

Jamming
coding
Transmitters
secrecy
Conveying
Random variables
Degradation
recipient
communication
time

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

@article{5e789b5906c649708232f9765c4e0888,
title = "Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming",
abstract = "We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters. No degradation or symmetry assumptions are made on the channel. Our main result is that any rate pair known to be achievable with a random coding like proof, is also achievable with an explicit and low-complexity polar coding scheme. Moreover, if the rate pair is known to be achievable without time-sharing, then time-sharing is not needed in our polar coding scheme as well. Our proof technique relies on rate-splitting, which introduces two virtual transmitters, and cooperative jamming strategies implemented by these virtual transmitters. Specifically, our coding scheme combines point-to-point codes that either aim at secretly conveying a message to the legitimate receiver or at performing cooperative jamming. Each point-to-point code relies on block Markov encoding to be able to deal with an arbitrary channel and strong secrecy. Consequently, our coding scheme is the combination of inter-dependent block Markov constructions. We assess reliability and strong secrecy through a detailed analysis of the dependencies between the random variables involved in the scheme.",
author = "Chou, {Remi A.} and Aylin Yener",
year = "2018",
month = "12",
day = "1",
doi = "10.1109/TIT.2018.2865741",
language = "English (US)",
volume = "64",
pages = "7903--7921",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming. / Chou, Remi A.; Yener, Aylin.

In: IEEE Transactions on Information Theory, Vol. 64, No. 12, 8438560, 01.12.2018, p. 7903-7921.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming

AU - Chou, Remi A.

AU - Yener, Aylin

PY - 2018/12/1

Y1 - 2018/12/1

N2 - We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters. No degradation or symmetry assumptions are made on the channel. Our main result is that any rate pair known to be achievable with a random coding like proof, is also achievable with an explicit and low-complexity polar coding scheme. Moreover, if the rate pair is known to be achievable without time-sharing, then time-sharing is not needed in our polar coding scheme as well. Our proof technique relies on rate-splitting, which introduces two virtual transmitters, and cooperative jamming strategies implemented by these virtual transmitters. Specifically, our coding scheme combines point-to-point codes that either aim at secretly conveying a message to the legitimate receiver or at performing cooperative jamming. Each point-to-point code relies on block Markov encoding to be able to deal with an arbitrary channel and strong secrecy. Consequently, our coding scheme is the combination of inter-dependent block Markov constructions. We assess reliability and strong secrecy through a detailed analysis of the dependencies between the random variables involved in the scheme.

AB - We consider strongly secure communication over a discrete memoryless multiple access wiretap channel with two transmitters. No degradation or symmetry assumptions are made on the channel. Our main result is that any rate pair known to be achievable with a random coding like proof, is also achievable with an explicit and low-complexity polar coding scheme. Moreover, if the rate pair is known to be achievable without time-sharing, then time-sharing is not needed in our polar coding scheme as well. Our proof technique relies on rate-splitting, which introduces two virtual transmitters, and cooperative jamming strategies implemented by these virtual transmitters. Specifically, our coding scheme combines point-to-point codes that either aim at secretly conveying a message to the legitimate receiver or at performing cooperative jamming. Each point-to-point code relies on block Markov encoding to be able to deal with an arbitrary channel and strong secrecy. Consequently, our coding scheme is the combination of inter-dependent block Markov constructions. We assess reliability and strong secrecy through a detailed analysis of the dependencies between the random variables involved in the scheme.

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

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

U2 - 10.1109/TIT.2018.2865741

DO - 10.1109/TIT.2018.2865741

M3 - Article

VL - 64

SP - 7903

EP - 7921

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 12

M1 - 8438560

ER -