Exact Correct-Decoding Exponent of the Wiretap Channel Decoder

DOI10.1109/TIT.2014.2361765zbMATH Open1359.94861arXiv1403.6143OpenAlexW3101891250MaRDI QIDQ2979151FDOQ2979151

Publication date: 2 May 2017

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

Abstract: The security level of the achievability scheme for Wyner's wiretap channel model is examined from the perspective of the probability of correct decoding,

P_{c}

, at the wiretap channel decoder. In particular, for finite-alphabet memoryless channels, the exact random coding exponent of

P_{c}

is derived as a function of the total coding rate

R_{1}

and the rate of each sub-code

R_{2}

. Two different representations are given for this function and its basic properties are provided. We also characterize the region of pairs of rates

(R_{1}, R_{2})

of full security in the sense of the random coding exponent of

P_{c}

, in other words, the region where the exponent of this achievability scheme is the same as that of blind guessing at the eavesdropper side. Finally, an analogous derivation of the correct-decoding exponent is outlined for the case of the Gaussian channel.

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

Mathematics Subject Classification ID

Decoding (94B35)

This page was built for publication: Exact Correct-Decoding Exponent of the Wiretap Channel Decoder

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