arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.04512cs.ITmath.IT
收藏

利用极化码实现边缘信道容量的研究

On the Construction of Polar Codes for Achieving the Capacity of Marginal Channels

Amirsina Torfi, Sobhan Soleymani, Siamak Aram, Vahid Tabataba Vakili

摘要:

在通信场景中,实现针对具有无限计算能力的对手的安全性是非常有意义的。由于极化码是一种具有低编解码复杂度的容量实现码,并且在对称环境下,它们可以接近二进制输入降级窃听信道的完美保密率,因此最近在文献中对其进行了广泛的研究。本文提出了一种在非对称二进制输入信道下实现保密容量的极化编码方案。该方案满足安全性和可靠性条件。假设窃听信道相对于合法信道是随机退化的,并且消息分布是均匀的。信息集通过对Bob有利而对Eve不利的渠道发送。随机比特通过对鲍勃和夏娃都有利的信道发送。冻结向量是随机选择的,并通过对两者都不利的信道发送。我们证明了存在一个冻结向量,使编码方案满足可靠性和安全性条件,并接近保密容量。我们进一步实证表明,在非对称二进制输入离散无记忆信道的建议计划,模糊率达到其上限在整个容量模糊区域。

英文摘要:

Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect secrecy rates for binary-input degraded wiretap channels in symmetric settings, they are investigated extensively in the literature recently. In this paper, a polar coding scheme to achieve secrecy capacity in non-symmetric binary input channels is proposed. The proposed scheme satisfies security and reliability conditions. The wiretap channel is assumed to be stochastically degraded with respect to the legitimate channel and message distribution is uniform. The information set is sent over channels that are good for Bob and bad for Eve. Random bits are sent over channels that are good for both Bob and Eve. A frozen vector is chosen randomly and is sent over channels bad for both. We prove that there exists a frozen vector for which the coding scheme satisfies reliability and security conditions and approaches the secrecy capacity. We further empirically show that in the proposed scheme for non-symmetric binary-input discrete memoryless channels, the equivocation rate achieves its upper bound in the whole capacity-equivocation region.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑