高斯窃听信道最优码的MMSE特性研究

R. Bustin, R. Schaefer, H. Poor, S. Shamai
{"title":"高斯窃听信道最优码的MMSE特性研究","authors":"R. Bustin, R. Schaefer, H. Poor, S. Shamai","doi":"10.1109/ITW.2015.7133139","DOIUrl":null,"url":null,"abstract":"This work examines the properties of “good” codes for the scalar Gaussian wiretap channel that achieve the maximum level of equivocation. Specifically, the minimum mean-square error (MMSE) behavior of these codes is explored as a function of the signal-to-noise ratio (SNR). It is first shown that reliable decoding of the codeword at the legitimate receiver and at the eavesdropper, conditioned on the transmitted message, is a necessary and sufficient condition for an optimally secure code sequence. Moreover, it is observed that a stochastic encoder is required for any code sequence with rate below the channel point-to-point capacity. Then, for code sequences attaining the maximum level of equivocation, it is shown that their codebook sequences must resemble “good” point-to-point, capacity achieving, code sequences. Finally, it is shown that the mapping over such “good” codebook sequences that produces a maximum equivocation code must saturate the eavesdropper. These results support several “rules of thumb” in the design of capacity achieving codes for the Gaussian wiretap.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On MMSE properties of optimal codes for the Gaussian wiretap channel\",\"authors\":\"R. Bustin, R. Schaefer, H. Poor, S. Shamai\",\"doi\":\"10.1109/ITW.2015.7133139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work examines the properties of “good” codes for the scalar Gaussian wiretap channel that achieve the maximum level of equivocation. Specifically, the minimum mean-square error (MMSE) behavior of these codes is explored as a function of the signal-to-noise ratio (SNR). It is first shown that reliable decoding of the codeword at the legitimate receiver and at the eavesdropper, conditioned on the transmitted message, is a necessary and sufficient condition for an optimally secure code sequence. Moreover, it is observed that a stochastic encoder is required for any code sequence with rate below the channel point-to-point capacity. Then, for code sequences attaining the maximum level of equivocation, it is shown that their codebook sequences must resemble “good” point-to-point, capacity achieving, code sequences. Finally, it is shown that the mapping over such “good” codebook sequences that produces a maximum equivocation code must saturate the eavesdropper. These results support several “rules of thumb” in the design of capacity achieving codes for the Gaussian wiretap.\",\"PeriodicalId\":174797,\"journal\":{\"name\":\"2015 IEEE Information Theory Workshop (ITW)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2015.7133139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2015.7133139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

这项工作检查了“好”代码的属性,为标量高斯窃听信道实现最大程度的模糊。具体来说,这些代码的最小均方误差(MMSE)行为作为信噪比(SNR)的函数进行了探索。首先证明了在合法接收方和窃听方根据所传输的信息对码字进行可靠解码,是最优安全码序列的充分必要条件。此外,观察到对于任何速率低于信道点对点容量的编码序列都需要随机编码器。然后,对于达到最大模糊程度的码序列,表明它们的码本序列必须类似于“好的”点对点、容量实现的码序列。最后,证明了在这样的“好”码本序列上的映射产生最大的模糊码必须使窃听者饱和。这些结果支持了高斯窃听容量实现代码设计中的几个“经验法则”。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On MMSE properties of optimal codes for the Gaussian wiretap channel
This work examines the properties of “good” codes for the scalar Gaussian wiretap channel that achieve the maximum level of equivocation. Specifically, the minimum mean-square error (MMSE) behavior of these codes is explored as a function of the signal-to-noise ratio (SNR). It is first shown that reliable decoding of the codeword at the legitimate receiver and at the eavesdropper, conditioned on the transmitted message, is a necessary and sufficient condition for an optimally secure code sequence. Moreover, it is observed that a stochastic encoder is required for any code sequence with rate below the channel point-to-point capacity. Then, for code sequences attaining the maximum level of equivocation, it is shown that their codebook sequences must resemble “good” point-to-point, capacity achieving, code sequences. Finally, it is shown that the mapping over such “good” codebook sequences that produces a maximum equivocation code must saturate the eavesdropper. These results support several “rules of thumb” in the design of capacity achieving codes for the Gaussian wiretap.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Degraded broadcast channel: Secrecy outside of a bounded range On compute-and-forward with feedback On the capacity of multihop device-to-device caching networks Lattice index coding for the broadcast channel On the transmission of a bivariate Gaussian source over the Gaussian broadcast channel with feedback
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1