Problem
Research questions and friction points this paper is trying to address.
polar codes
wiretap channel
total variation distance
finite blocklength
secrecy
Finite-blocklength performance of polar wiretap codes under a total variation secrecy constraint
🤖 AI Summary
This work investigates the secrecy performance of polar codes under a total variation distance (TVD) secrecy constraint for degraded symmetric wiretap channels in the finite blocklength regime. By characterizing information leakage as the sum of TVDs over bit-channels, the paper proposes a novel design criterion for polar wiretap codes based on an upper bound on TVD-based leakage, applicable to both asymptotic and finite blocklength settings. Leveraging polar code construction, TVD analysis, and modeling of the binary erasure wiretap channel, the authors derive lower bounds on the secrecy rates achievable by several classes of polar wiretap codes at finite blocklengths. They further prove that the TVD-based leakage vanishes asymptotically with increasing blocklength, thereby demonstrating the effectiveness and feasibility of the proposed scheme.
📝 Abstract
We study the performance of polarizing codes over a degraded symmetric wiretap channel under a total variation distance (TVD) secrecy constraint. We show that the leakage can be bounded by the sum of the TVDs of the bit-channels corresponding to the confidential and frozen bits. In the asymptotic regime, this gives a new criterion to design wiretap codes with vanishing TVD leakage. In finite blocklength, it allows us to compute lower bounds for the secrecy rate of different families of polarizing wiretap codes over a binary erasure wiretap channel.
Innovation
Methods, ideas, or system contributions that make the work stand out.
polar wiretap codes
total variation distance
finite blocklength
secrecy rate
bit-channel
🔎 Similar Papers
No similar papers found.
