Maximum Zero-Outage Secrecy Capacity of Fading Wiretap Channels with Finite Alphabets

When a transmitted signal encounters slow fading and the support of the fading gain contains zero, an outage event will happen inevitably, if the transmitter has no knowledge of the channel state. This will deteriorate the system performance metrics such as latency due to re-transmissions caused by the outages. For scenarios like this, we use the outage probability or the outage capacity to measure the system performance. In this work, we investigate the possibility of achieving a positive zero-outage secrecy capacity (ZOSC) for a wiretap channel with fading gains from finite alphabet sets. In particular, we investigate the minimum secrecy outage probability with respect to all possible joint distributions of the fading gains, given their marginal distributions. We propose a systematic scheme to calculate the minimum secrecy outage probability by solving linear programming problems. From this, the maximum ZOSC of the considered wiretap channel model directly follows. Interestingly, we find that scenarios with a ZOSC of zero for independent fading can support a positive ZOSC when the fading links are dependent.