🤖 AI Summary
This work addresses the challenge of achieving optimal secure transmission over an AWGN wiretap channel with noiseless feedback under finite blocklength constraints, where the classical Schalkwijk–Kailath (SK) scheme falls short. The paper presents the first finite-blocklength analysis of the secrecy capacity for this channel, introduces an improved SK-type coding scheme, and derives the first finite-blocklength converse bound tailored to this model. Both theoretical analysis and numerical experiments demonstrate that the proposed scheme significantly outperforms the classical SK approach at practical blocklengths. Moreover, in the absence of secrecy constraints, the framework yields a novel converse bound for feedback communication, thereby offering new theoretical tools for the design and analysis of secure feedback systems.
📝 Abstract
In the literature, it has been shown that the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel with noise-free feedback equals the capacity of the same model without secrecy constraint, and the classical Schalkwijk-Kailath (SK) scheme achieves the secrecy capacity. In this paper, we show that in finite blocklength regime, the SK scheme is not optimal, and propose a modified SK scheme which may perform better than the classical one. Besides this, this paper establishes a finite blocklength converse for the AWGN wiretap channel with feedback, which can also be viewed as a converse for the same model without secrecy constraint. To the best of the authors'knowledge, this is the first paper to address such a problem, and the results of this paper are further explained via numerical examples.