English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We investigate the transmission of a secret message from Alice to Bob in thepresence of an eavesdropper (Eve) and many of decode-and-forward relay nodes.Each link comprises a set of parallel channels, modeling for example anorthogonal frequency division multiplexing transmission. We consider the impactof discrete constellations and finite-length coding, defining an achievablesecrecy rate under a constraint on the equivocation rate at Eve. Then wepropose a power and channel allocation algorithm that maximizes the achievablesecrecy rate by resorting to two coupled Gale-Shapley algorithms for stablematching problem. We consider the scenarios of both full and partial channelstate information at Alice. In the latter case, we only guarantee an outagesecrecy rate, i.e., the rate of a message that remains secret with a givenprobability. Numerical results are provided for Rayleigh fading channels interms of average outage secrecy rate, showing that practical schemes achieve aperformance quite close to that of ideal ones.

Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations