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

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

筛选
英文 中文
Second-Order Asymptotically Optimal Outlying Sequence Detection with Reject Option 带拒绝选项的二阶渐近最优离群序列检测
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611462
Lin Zhou, A. Hero, Yun Wei
{"title":"Second-Order Asymptotically Optimal Outlying Sequence Detection with Reject Option","authors":"Lin Zhou, A. Hero, Yun Wei","doi":"10.1109/ITW48936.2021.9611462","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611462","url":null,"abstract":"Motivated by practical machine learning applications, we revisit the outlying sequence detection problem (Li et al., TIT 2014) and derive fundamental limits of optimal detection when the reject option is allowed for outlying sequences. In the considered outlying sequence detection (OSD) problem, one is given multiple observed sequences, where all sequences are generated i.i.d. from a nominal distribution with at most one exception. The task is to discern the outlying sequence that is generated according to an anomalous distribution. In OSD, the nominal and anomalous distributions are unknown. In this paper, we consider the case where there is a reject option for the OSD, i.e., we reject the samples as insufficient for making a reliable decision (cf. Bartlett et al., JMLR 2008). We study the tradeoff among the probabilities of misclassification error, false alarm and false reject for tests that satisfy weak conditions on the rate of decrease of these error probabilities as a function of sequence length. We propose a second-order asymptotically optimal test that provides a finite sample approximation to the error probabilities.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"136 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131212553","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
On Cloud Radio Access Networks With Cascade Oblivious Relaying 基于级联无关中继的云无线接入网络
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611433
Mehrangiz Ensan, Hamdi Joudeh, A. Alvarado, U. Gustavsson, F. Willems
{"title":"On Cloud Radio Access Networks With Cascade Oblivious Relaying","authors":"Mehrangiz Ensan, Hamdi Joudeh, A. Alvarado, U. Gustavsson, F. Willems","doi":"10.1109/ITW48936.2021.9611433","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611433","url":null,"abstract":"We consider a discrete memoryless cloud radio access network in which K users communicate with a remote destination through 2 relays in a cascade. The relays are oblivious in the sense that they operate without knowledge of the users’ codebooks. We focus on a scenario where the first and second relays are connected through a finite-capacity error-free link, while the second relay is connected to the remote destination via an infinite-capacity link. We establish the capacity region in this case, and show that it is achieved via a compress-and-forward scheme with successive decoding. Finally, the extension to Gaussian networks is discussed.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133369242","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
Design of Short Blocklength Wiretap Channel Codes: Deep Learning and Cryptography Working Hand in Hand 短块长度窃听信道码的设计:深度学习和密码学携手工作
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611401
Vidhi Rana, Rémi A. Chou
{"title":"Design of Short Blocklength Wiretap Channel Codes: Deep Learning and Cryptography Working Hand in Hand","authors":"Vidhi Rana, Rémi A. Chou","doi":"10.1109/ITW48936.2021.9611401","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611401","url":null,"abstract":"We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. Our approach consists in decoupling the reliability and secrecy constraints in our code design. Specifically, we handle the reliability constraint via an autoencoder, and handle the secrecy constraint via hash functions. For blocklengths smaller than 16, we evaluate through simulations the probability of error at the legitimate receiver and the leakage at the eavesdropper of our code construction. This leakage is defined as the mutual information between the confidential message and the eavesdropper’s channel observations, and is empirically measured via a recent mutual information neural estimator. Simulation results provide examples of codes with positive rates that achieve a leakage inferior to one percent of the message length.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125987924","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
Combined polar-LDPC design for channels with high noise 针对高噪声信道的极- ldpc组合设计
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611452
I. Dumer, Navid Gharavi
{"title":"Combined polar-LDPC design for channels with high noise","authors":"I. Dumer, Navid Gharavi","doi":"10.1109/ITW48936.2021.9611452","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611452","url":null,"abstract":"We combine polar and LDPC codes to address data correction for various low-power applications. We first use long low-rate LDPC codes that have parity checks of a low weight. Decoding performs several iterations of the belief propagation (BP) algorithm that recalculates the information bits only. Partially corrected bits are then passed to a short polar code that uses successive cancellation list (SCL) decoder. The newly corrected bits then serve as the new inputs for an LDPC decoder. For codes of rate less than 0.1, the algorithm performs on par with a CA-SCL decoder, while substantially reducing its latency.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124687568","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
Concentration of Random-Coding Error Exponents 随机编码错误指数的集中
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611426
Lan V. Truong, G. Cocco, Josep Font-Segura, A. Guillén i Fàbregas
{"title":"Concentration of Random-Coding Error Exponents","authors":"Lan V. Truong, G. Cocco, Josep Font-Segura, A. Guillén i Fàbregas","doi":"10.1109/ITW48936.2021.9611426","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611426","url":null,"abstract":"This paper studies the error exponent of i.i.d. randomly generated codes used for transmission over discrete memoryless channels with maximum likelihood decoding. Specifically, this paper shows that the error exponent of a code, defined as the negative normalized logarithm of the probability of error, converges in probability to the typical error exponent. For high rates, the result is a consequence of the fact that the random-coding error exponent and the sphere-packing error exponent coincide. For low rates, instead, the proof of convergence is based on the fact that the union bound accurately characterizes the probability of error.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124749627","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
Guaranteed Rate of Streaming Erasure Codes over Multi-Link Multi-hop Network 多链路多跳网络中流纠删码的保证速率
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611474
E. Domanovitz, G. Facenda, A. Khisti, Wai-tian Tan, J. Apostolopoulos
{"title":"Guaranteed Rate of Streaming Erasure Codes over Multi-Link Multi-hop Network","authors":"E. Domanovitz, G. Facenda, A. Khisti, Wai-tian Tan, J. Apostolopoulos","doi":"10.1109/ITW48936.2021.9611474","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611474","url":null,"abstract":"We study the problem of transmitting a sequence of messages (streaming messages) through a multi-link, multi-hop packet erasure network. Each message must be reconstructed in-order and under a strict delay constraint. Special cases of our setting with a single link on each hop have been studied recently - the case of a single relay-node, is studied in Fong et al [1]; the case of multiple relays, is studied in Domanovitz et al [2]. As our main result, we propose an achievable rate expression that reduces to previously known results when specialized to their respective settings. Our proposed scheme is based on the idea of concatenating single-link codes from [2] in a judicious manner to achieve the required delay constraints. We propose a systematic approach based on convex optimization to maximize the achievable rate in our framework.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128328753","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
Identification under Effective Secrecy 有效保密下的身份识别
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611488
Abdalla Ibrahim, R. Ferrara, C. Deppe
{"title":"Identification under Effective Secrecy","authors":"Abdalla Ibrahim, R. Ferrara, C. Deppe","doi":"10.1109/ITW48936.2021.9611488","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611488","url":null,"abstract":"We study the problem of identification over a DMC wiretap channel under effective secrecy. In identification, due to the fact that single messages are compared to each other, all conditions are inherently semantic, and thus we are forced to consider semantic effective secrecy. We show that even effective secrecy “comes for free” by giving an achievability theorem for stealth identification. We use two concatenated transmission codes, the first one is a resolvability transmission code. The second code is an effective-secrecy transmission code. An achievable rate is derived for the problem.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114179673","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
Decentralized Multi-access Coded Caching with Uncoded Prefetching 分散式多访问编码缓存与非编码预取
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611497
P. Trinadh, Monolina Dutta, Anoop Thomas, B. Rajan
{"title":"Decentralized Multi-access Coded Caching with Uncoded Prefetching","authors":"P. Trinadh, Monolina Dutta, Anoop Thomas, B. Rajan","doi":"10.1109/ITW48936.2021.9611497","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611497","url":null,"abstract":"Data traffic in a client-server framework exhibits a temporal variability leading to congestion of resources at peak hours. One prevalent technique to overcome this problem is to load popular content/data into cache memories distributed across the end users. In this paper, the multi-access coded caching problem is considered in which each client is connected to multiple consecutive caches in a cyclic wrap around fashion and the cache memories are arbitrarily loaded in a decentralized manner. A new delivery scheme is proposed for the decentralized multi-access coded caching problem. A lower bound on the delivery rate is also obtained for the decentralized multi-access coded caching problem using techniques from index coding. The delivery scheme is shown to be optimal among all linear schemes when the number of caches associated with each user satisfies certain constraints.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121509969","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
Lower Bounds on the Expected Excess Risk Using Mutual Information 基于互信息的期望超额风险下界
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611483
M. B. Dogan, M. Gastpar
{"title":"Lower Bounds on the Expected Excess Risk Using Mutual Information","authors":"M. B. Dogan, M. Gastpar","doi":"10.1109/ITW48936.2021.9611483","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611483","url":null,"abstract":"The expected excess risk of a learning algorithm is the average suboptimality of using the learning algorithm, relative to the optimal hypothesis in the hypothesis class. In this work, we lower bound the expected excess risk of a learning algorithm using the mutual information between the input and the noisy output of the learning algorithm. The setting we consider is, where the hypothesis class is the set of real numbers and the true risk function has a local strong convexity property. Our main results also lead to asymptotic lower bounds on the expected excess risk, which do not require the knowledge of the local strong convexity constants of the true risk function.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122813254","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
The Intersection of Insertion and Deletion Balls 插入球和删除球的交集
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-10-17 DOI: 10.1109/ITW48936.2021.9611515
Dan Bar-Lev, Omer Sabary, Yotam Gershon, Eitan Yaakobi
{"title":"The Intersection of Insertion and Deletion Balls","authors":"Dan Bar-Lev, Omer Sabary, Yotam Gershon, Eitan Yaakobi","doi":"10.1109/ITW48936.2021.9611515","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611515","url":null,"abstract":"This paper studies the intersections of insertion and deletion balls. The t-insertion, t-deletion ball of a sequence x is the set of all sequences received by t insertions, deletions to x, respectively. While the intersection of either deletion balls or insertion balls has been rigorously studied before, the intersection of an insertion ball and a deletion ball has not been addressed so far. We find the maximum intersection size of any two insertion and deletion balls in the binary case. For the special case of one-insertion and one-deletion balls we find the intersection size for all pair of sequences. Then, we derive the largest and average values of this intersection size. Lastly, we present an algorithm that efficiently computes the intersection of any t1-insertion ball and t2-deletion ball.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133479670","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信