发布求助
文献互助 智能选刊 最新文献

2019 IEEE Information Theory Workshop (ITW)最新文献

筛选
英文 中文
Some Results on Distributed Source Simulation with no Communication 无通信分布式源仿真的一些结果
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989131
Tomer Berg, O. Shayevitz, Young-Han Kim, Lele Wang
{"title":"Some Results on Distributed Source Simulation with no Communication","authors":"Tomer Berg, O. Shayevitz, Young-Han Kim, Lele Wang","doi":"10.1109/ITW44776.2019.8989131","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989131","url":null,"abstract":"We consider the problem of distributed source simulation with no communication, in which Alice and Bob observe sequences Un and Vn respectively, drawn from a joint distribution $p_{UV}^{otimes n}$, and wish to locally generate sequences Xn and Yn respectively with a joint distribution that is close (in KL divergence) to $p_{XY}^{otimes n}$. We provide a single-letter condition under which such a simulation is asymptotically possible with a vanishing KL divergence. Our condition is nontrivial only in the case where the Gàcs-Körner (GK) common information between U and V is nonzero, and we conjecture that only scalar Markov chains $X-U-V-Y$ can be simulated otherwise. Motivated by this conjecture, we further examine the case where both pUV and pXY are doubly symmetric binary sources with parameters $p, qleq 1/2$ respectively. While it is trivial that in this case $pleq q$ is both necessary and sufficient, we show that when p is close to q then any successful simulation is close to being scalar in the total variation sense.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116154008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Differential Power Analysis Attacks from an Information-Theoretic Perspective 信息论视角下的差分功率分析攻击
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989406
Andrea Grigorescu, H. Boche
{"title":"Differential Power Analysis Attacks from an Information-Theoretic Perspective","authors":"Andrea Grigorescu, H. Boche","doi":"10.1109/ITW44776.2019.8989406","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989406","url":null,"abstract":"Differential power analysis (DPA) attacks exploit the variance in power measurements of cryptographic devices to recover secret keys. What can an adversary achieve with power measurements? In this work, information-theoretic tools are used to quantity the amount of sensitive information revealed by a power measurement. It is shown that in order to find a secret key, an adversary needs to try a number of different keys. The number is exponential to the key size and the exponent is given by the key’s entropy, conditioned on the power measurement.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124111673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Coding for Non-IID Sources and Channels: Entropic Approximations and a Question of Ahlswede 非iid源和通道的编码:熵近似和一个Ahlswede问题
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989316
H. Boche, R. Schaefer, H. Poor
{"title":"Coding for Non-IID Sources and Channels: Entropic Approximations and a Question of Ahlswede","authors":"H. Boche, R. Schaefer, H. Poor","doi":"10.1109/ITW44776.2019.8989316","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989316","url":null,"abstract":"The theory of Verdú and Han provides a powerful framework to analyze and study general non-independent and identically distributed (non-i.i. d.) sources and channels. Already for simple non-i.i. d. sources and channels, this framework can result in complicated general capacity formulas. Ahlswede asked in his Shannon lecture if these general capacity formulas can be effectively, i.e., algorithmically, computed. In this paper, it is shown that there exist computable non-i.i. d. sources and channels, for which the capacity is a non-computable number. Even worse, it is shown that there are non-i.i. d. sources and channels for which the capacity is a computable number, i.e., the limit of the corresponding sequence of multi-letter capacity expressions is computable, but the convergence of this sequence is not effective. This answers Ahlswede’s question in a strong form, since in this case, the multi-letter capacity expressions for these sources and channels cannot be used to approximate the optimal performance algorithmically.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126036181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Secure Caching and Delivery for Combination Networks with Asymmetric Connectivity 非对称连接组合网络的安全缓存和传输
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989151
Ahmed A. Zewail, A. Yener
{"title":"Secure Caching and Delivery for Combination Networks with Asymmetric Connectivity","authors":"Ahmed A. Zewail, A. Yener","doi":"10.1109/ITW44776.2019.8989151","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989151","url":null,"abstract":"We consider information theoretic security in a two-hop combination network where there are groups of end users with distinct degrees of connectivity served by a layer of relays. The model represents a network set up with users having access to asymmetric resources, here the number of relays that they are connected to, yet demand security guarantees uniformly. We study two security constraints separately and simultaneously: secure delivery where the information must be kept confidential from an external entity that wiretaps the delivery phase; and secure caching where each cache-aided end-user can retrieve the file it requests and cannot obtain any information on files it does not. The achievable schemes we construct are multi-stage where each stage completes requests by a class of users.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133319888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Fixed-Length Strong Coordination 定长强协调
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989338
Giulia Cervia, T. Oechtering, M. Skoglund
{"title":"Fixed-Length Strong Coordination","authors":"Giulia Cervia, T. Oechtering, M. Skoglund","doi":"10.1109/ITW44776.2019.8989338","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989338","url":null,"abstract":"We consider the problem of synthesizing joint distributions of signals and actions over noisy channels in the finite length regime. For a fixed blocklength n and an upper bound on the distance $varepsilon$, a coding scheme is proposed such that the induced joint distribution is $varepsilon$-close in L1 distance to a target i.i.d. distribution. The set of achievable target distributions and rate for asymptotic strong coordination can be recovered from the main result of this paper by having n that tends to infinity.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115475014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Channel Coding at Low Capacity 低容量信道编码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989142
Mohammad Fereydounian, Mohammad Vahid Jamali, Hamed Hassani, Hessam Mahdavifar
{"title":"Channel Coding at Low Capacity","authors":"Mohammad Fereydounian, Mohammad Vahid Jamali, Hamed Hassani, Hessam Mahdavifar","doi":"10.1109/ITW44776.2019.8989142","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989142","url":null,"abstract":"Low-capacity scenarios have become increasingly important in the technology of Internet of Things (IoT) and the next generation of mobile networks. Such scenarios require efficient and reliable transmission of information over channels with an extremely small capacity. Within these constraints, the performance of state-of-the-art coding techniques is far from optimal in terms of either rate or complexity. Moreover, the current non-asymptotic laws of optimal channel coding provide inaccurate predictions for coding in the low-capacity regime. In this paper, we provide the first comprehensive study of channel coding in the low-capacity regime. We will investigate the fundamental non-asymptotic limits for channel coding as well as challenges that must be overcome for efficient code design in low-capacity scenarios.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114104378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Capacity Results for Discrete Memoryless Channels in the Finite Blocklength Regime 有限块长度下离散无记忆信道的容量结果
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989294
Y. Oohama
{"title":"Capacity Results for Discrete Memoryless Channels in the Finite Blocklength Regime","authors":"Y. Oohama","doi":"10.1109/ITW44776.2019.8989294","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989294","url":null,"abstract":"We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum approach is quite useful for investigating this problem.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116545658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A New Importance Sampling Algorithm for Fast Simulation of Linear Block Codes over BSCs 一种新的BSCs上线性分组码快速仿真的重要采样算法
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989120
Jinzhe Pan, W. Mow
{"title":"A New Importance Sampling Algorithm for Fast Simulation of Linear Block Codes over BSCs","authors":"Jinzhe Pan, W. Mow","doi":"10.1109/ITW44776.2019.8989120","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989120","url":null,"abstract":"In this paper, we propose an Importance Sampling (IS) scheme for fast simulation of linear block codes over binary symmetric channels (BSCs). By re-formulating the IS problem into the one-dimensional Hamming weight space, we propose a novel IS estimator and derive the optimal IS distribution which will minimize the variance of the estimator. Consequently, a corresponding iterative algorithm is proposed. The effectiveness of the proposed IS algorithm compared to the state-of-the-art IS algorithm is demonstrated in the word error rate simulation of both LDPC and Polar codes.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125798899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On the Nonasymptotic Performance of Variable-Length Codes with Noisy Stop Feedback 带噪声停止反馈的变长码的非渐近性能
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989314
Johan Östman, Rahul Devassy, G. Durisi, E. Ström
{"title":"On the Nonasymptotic Performance of Variable-Length Codes with Noisy Stop Feedback","authors":"Johan Östman, Rahul Devassy, G. Durisi, E. Ström","doi":"10.1109/ITW44776.2019.8989314","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989314","url":null,"abstract":"We present an upper bound on the error probability achievable using variable-length stop-feedback codes, for a fixed size of the information payload and a given constraint on both the average and the maximum latency. Differently from the bound proposed in Polyanskiy et at. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant scenario in which the feedback link is noisy. Through numerical results, we illustrate that, in scenarios in which the desired average latency is small, noise in the feedback link can deteriorate the performance of variable-length stop-feedback codes to the extent that it becomes inferior to that of fixed-length codes without feedback.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125877372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
SC-Flip Decoding of Polar Codes with High Order Error Correction Based on Error Dependency 基于错误依赖的极性码高阶纠错sc -翻转译码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989249
C. Condo, Valerio Bioglio, I. Land
{"title":"SC-Flip Decoding of Polar Codes with High Order Error Correction Based on Error Dependency","authors":"C. Condo, Valerio Bioglio, I. Land","doi":"10.1109/ITW44776.2019.8989249","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989249","url":null,"abstract":"The successive cancellation flip (SC-Flip) decoding algorithm arose as a valid low-complexity decoding algorithm for polar codes, however its decoding capabilities are still far away from list based decoders. In this paper, we propose an improved SC-Flip multiple error decoding framework based on error dependency, and specialize it for the two-error correction case. We propose to generate different lists of second error locations based on the index of the expected first errors. The inherent flexibility of this approach allows it to be modified for a desired trade-off between performance and complexity. Two second errors list construction approaches are presented, and are shown to yield gains over the original SC-Flip decoder at the same decoding complexity.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117084912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信