This paper uses Euclidean Information Theory (EIT) to analyze the wiretap channel. We investigate a scenario of efficiently transmitting a small amount of information subject to compression rate and secrecy constraints. We transform the information-theoretic problem into a linear algebra problem and obtain the perturbed probability distributions such that secrecy is achievable. Local approximations are being used in order to obtain an estimate of the secrecy capacity by solving a generalized eigenvalue problem.

翻译：本文利用欧几里得信息论（EIT）分析窃听信道。我们研究了在压缩速率和保密约束条件下高效传输少量信息的场景。将信息论问题转化为线性代数问题，并得到可实现保密的扰动概率分布。通过求解广义特征值问题，采用局部逼近方法获取保密容量的估计值。