Secure multiplex coding to attain the channel capacity in wiretap channels
Secure multiplex coding to attain the channel capacity in wiretap channels
复制标题
安全多路复用编码以获得窃听信道中的信道容量
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
T. Ogawa
中科院分区：
文献类型：
--
作者：
Daisuke Kobayashi;Hirosuke Yamamoto;T. Ogawa
众所周知，如果编码率小于所谓的保密容量$C_S$，则可以在没有密钥的情况下通过噪声信道安全地传输消息，以对抗任何窃听者。保密容量通常小于信道容量$C$。为了消除C-CS损失，本文提出了一种多个独立消息的多路复用编码方案.在本文中，它表明，所提出的多路复用编码方案可以获得的信道容量的总速率的多个消息和完美的保密每个消息。通过推广Hayashi的证明，证明了编码定理，其中信道可分辨性的编码被应用于窃听信道。
It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity $C_S$, which is usually smaller than the channel capacity $C$. In order to remove the loss $C - C_S$, we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multiplex coding scheme can attain the channel capacity as the total rate of the plural messages and the perfect secrecy for each message. The coding theorem is proved by extending Hayashi's proof, in which the coding of the channel resolvability is applied to wiretap channels.