Cooperative jamming polar codes for multiple-access wiretap channels

The authors study cooperative security in the physical layer of wireless systems based on the recently developed polar codes for multiple access channel (MAC). Specifically, the authors first consider the case of a m-user MAC with external eavesdropper. Using polar alignment, the authors formulate a...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IET communications Ročník 10; číslo 4; s. 407 - 415
Hlavní autoři:	Hajimomeni, Mona, Aghaeinia, Hassan, Kim, Il-Min, Kim, Kwihoon
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	The Institution of Engineering and Technology 03.03.2016
Témata:	2‐user Gaussian wiretap MAC channel Algorithms block error probability Blocking channel coding Channels Coding computational complexity cooperative communication cooperative jamming polar codes cooperative security deterministic binary matrices discrete optimisation problem error statistics Errors external eavesdropper Gaussian Gaussian channels legitimate receiver lower bound low‐complexity suboptimal algorithm matrix algebra multiple access channel multiple‐access wiretap channels multiuser channels multi‐access systems m‐user MAC optimisation Optimization polar alignment polynomial complexity reliability criteria Security Tal–Sharov–Vardy implementation telecommunication network reliability telecommunication security uniform sum secrecy rate maximization upper bound wireless systems telecommunication security channel coding Tal–Sharov–Vardy implementation multiple-access wiretap channels 2-user Gaussian wiretap MAC channel multiuser channels optimisation cooperative jamming polar codes telecommunication network reliability multiple access channel legitimate receiver multi-access systems reliability criteria external eavesdropper Gaussian channels error statistics wireless systems discrete optimisation problem polar alignment cooperative security m-user MAC upper bound lower bound low-complexity suboptimal algorithm cooperative communication matrix algebra polynomial complexity deterministic binary matrices block error probability uniform sum secrecy rate maximization computational complexity
ISSN:	1751-8628, 1751-8636
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!