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

2019 IEEE International Symposium on Information Theory (ISIT)最新文献

筛选
英文 中文
Structured Coding for Authentication in the Presence of a Malicious Adversary 存在恶意对手的结构化认证编码
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849581
Allison Beemer, O. Kosut, J. Kliewer, Eric Graves, Paul L. Yu
{"title":"Structured Coding for Authentication in the Presence of a Malicious Adversary","authors":"Allison Beemer, O. Kosut, J. Kliewer, Eric Graves, Paul L. Yu","doi":"10.1109/ISIT.2019.8849581","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849581","url":null,"abstract":"Authentication in the presence of a malicious adversary consists of either recovering the legitimate transmission or declaring that the adversary has interfered with the transmission. In this work, we present a structured coding scheme for keyless authentication over a discrete memoryless binary-input, symmetric adversarial channel. Our scheme allows for coding rates up to the non-adversarial capacity of the underlying channel, as well as bounded-complexity decoding.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"11 1","pages":"617-621"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81043383","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}
引用次数: 6
Mean estimation for entangled single-sample distributions 纠缠单样本分布的均值估计
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849279
Ankit Pensia, Varun Jog, Po-Ling Loh
{"title":"Mean estimation for entangled single-sample distributions","authors":"Ankit Pensia, Varun Jog, Po-Ling Loh","doi":"10.1109/ISIT.2019.8849279","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849279","url":null,"abstract":"We consider the problem of estimating the common mean of univariate data, when independent samples are drawn from non-identical symmetric, unimodal distributions. This captures the setting where all samples are Gaussian with different unknown variances. We propose an estimator that adapts to the level of heterogeneity in the data, achieving near-optimality in both the i.i.d. setting and some heterogeneous settings, where the fraction of \"low-noise\" points is as small as$frac{{log n}}{n}$. Our estimator is a hybrid of the modal interval, shorth, and median estimators from classical statistics. The rates depend on the percentile of the mixture distribution, making our estimators useful even for distributions with infinite variance.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"3 1","pages":"3052-3056"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88642057","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
Queue Management for Age Sensitive Status Updates 年龄敏感状态更新的队列管理
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849761
Antzela Kosta, N. Pappas, A. Ephremides, Vangelis Angelakis
{"title":"Queue Management for Age Sensitive Status Updates","authors":"Antzela Kosta, N. Pappas, A. Ephremides, Vangelis Angelakis","doi":"10.1109/ISIT.2019.8849761","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849761","url":null,"abstract":"We consider a system consisting of a source-destination communication link. At the transmitter of the source there is a buffer that stores packets containing status information. These randomly generated packets should keep the destination timely updated and they can be discarded to avoid wasting network resources for the transmission of stale information. In this setup, we provide an analysis of the age of information (AoI) and peak age of information (PAoI) performance of the system, with and without packet management at the transmission queue of the source node. The analysis indicates the potential performance gains obtained with the use of packet management.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"11 1","pages":"330-334"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88714891","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}
引用次数: 13
Overlapping Multi-Bandit Best Arm Identification 重叠多强盗最佳武器识别
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849327
J. Scarlett, Ilija Bogunovic, V. Cevher
{"title":"Overlapping Multi-Bandit Best Arm Identification","authors":"J. Scarlett, Ilija Bogunovic, V. Cevher","doi":"10.1109/ISIT.2019.8849327","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849327","url":null,"abstract":"In the multi-armed bandit literature, the multibandit best-arm identification problem consists of determining each best arm in a number of disjoint groups of arms, with as few total arm pulls as possible. In this paper, we introduce a variant of the multi-bandit problem with overlapping groups, and present two algorithms for this problem based on successive elimination and lower/upper confidence bounds (LUCB). We bound the number of total arm pulls required for high-probability best-arm identification in every group, and we complement these bounds with a near-matching algorithm-independent lower bound.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"121 2 1","pages":"2544-2548"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88763045","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}
引用次数: 8
Two Contributions to Error Exponents for Asynchronous Multiple Access Channel 异步多址通道错误指数的两个贡献
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849722
L. Farkas, Tamás Kói
{"title":"Two Contributions to Error Exponents for Asynchronous Multiple Access Channel","authors":"L. Farkas, Tamás Kói","doi":"10.1109/ISIT.2019.8849722","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849722","url":null,"abstract":"The following conjectures from previous work of the authors are proven, enhancing the relevance of results there on the subject in the title: (i) The error exponents previously derived assuming that consecutive messages could be encoded using different codebooks, are also achievable with each sender using only one codebook. (ii) In case the senders could be synchronized, controlled asynchronism (a deliberate shift of codewords) may admit to achieve error exponents unachievable by synchronous transmission.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"3 1","pages":"2664-2668"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87444512","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
On Byzantine Distributed Sequential Change Detection with Multiple Hypotheses 多假设拜占庭分布式顺序变化检测
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849778
Yu‐Jui Huang, Shih-Chun Lin, Yu-Chih Huang
{"title":"On Byzantine Distributed Sequential Change Detection with Multiple Hypotheses","authors":"Yu‐Jui Huang, Shih-Chun Lin, Yu-Chih Huang","doi":"10.1109/ISIT.2019.8849778","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849778","url":null,"abstract":"Sequential change point detection with multiple decentralized sensors is studied. Each sensor makes a local decision based on its own observations and reports it through a bandlimited link to a fusion center, which then decides whether the change has occurred. Since sensors in many applications such as cyber-physical systems are prone to a number of attacks such as Byzantine attacks, combating such a security breach becomes one of the most crucial issues. Previous works on sequential change detection under Byzantine attacks only focus on binary-hypothesis case, which significantly limits the applicability. In this paper, we consider the extension to the multi-hypothesis setting. We show that naively extending the existing method from the binary case to the multi-hypothesis one can result in a catastrophic event preventing the fusion center from making a conclusive decision. Thus we propose the other two new methods by allowing each sensor to cast multiple local alarms, and both can avoid this catastrophic event and improve the asymptotic detection delay. In analyzing detection delays of our multi-hypothesis schemes, we also show that for each hypothesis, asymptotically, it suffices to focus on the competing hypothesis that is closest in Kullback-Leibler distance. Through large sensor analysis, we also show that as the number of honest sensors grows, one of the proposed scheme, called the simultaneous rule, approaches the optimal performance within a factor of 2.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"39 1","pages":"2209-2213"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90649520","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
Optimizing Bounds on the Classical Information Rate of Quantum Channels with Memory 具有存储器的量子信道经典信息速率界的优化
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849773
Michael X. Cao, P. Vontobel
{"title":"Optimizing Bounds on the Classical Information Rate of Quantum Channels with Memory","authors":"Michael X. Cao, P. Vontobel","doi":"10.1109/ISIT.2019.8849773","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849773","url":null,"abstract":"We are interested in classical communication over a quantum channel with memory, in particular, we are interested in quantum-auxiliary-channel-based upper and lower bounds on the information rate. Toward improving these bounds, we propose efficient algorithms for optimizing the auxiliary channel. From a practical perspective, the lower bounds are of significant interest because they represent mismatched information rates, i.e., information rates that are achievable by a communication system where the decoder is matched to the auxiliary channel, instead of the original channel. Moreover, the auxiliary channels are learned in a data-driven approach, i.e., only input/output sequences of the true channel are needed, but not the channel model of the true channel.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"24 1","pages":"265-269"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91185267","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
An Almost Perfectly Predictable Process with No Optimal Predictor 一个几乎完全可预测的过程，没有最佳预测器
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849587
Dariusz Kalociński, Tomasz Steifer
{"title":"An Almost Perfectly Predictable Process with No Optimal Predictor","authors":"Dariusz Kalociński, Tomasz Steifer","doi":"10.1109/ISIT.2019.8849587","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849587","url":null,"abstract":"A novel kind of a negative result is presented for the problem of computable prediction. A non-stationary binary stochastic process is constructed for which almost surely no effective method of prediction achieves the infimum of prediction errors defined as the normalized Hamming distance between the sequence of predictions and the realization of the process. Yet it is shown that this process may be effectively predicted almost surely up to an arbitrarily small error since the infimum of prediction errors is zero.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"11 1","pages":"2504-2508"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84842433","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
The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity 二元对称信道的交互容量至少是香农容量的1/40
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/ISIT.2019.8849655
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, O. Shayevitz
{"title":"The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity","authors":"Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, O. Shayevitz","doi":"10.1109/ISIT.2019.8849655","DOIUrl":"https://doi.org/10.1109/ISIT.2019.8849655","url":null,"abstract":"We define the interactive capacity of the binary symmetric channel (BSC) as the maximal rate for which any interactive protocol can be fully and reliably simulated over a pair of BSC’s. We show that this quantity is at least 1/40 of the BSC Shannon capacity, uniformly for all channel crossover probabilities. Our result is based on a public-coin rewind-if-error coding scheme in the spirit of Kol & Raz 2013 [1].","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"156 1","pages":"2868-2872"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87176271","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
ISIT 2019 Technical Program Committee ISIT 2019技术计划委员会
2019 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2019-07-01 DOI: 10.1109/isit.2019.8849296
{"title":"ISIT 2019 Technical Program Committee","authors":"","doi":"10.1109/isit.2019.8849296","DOIUrl":"https://doi.org/10.1109/isit.2019.8849296","url":null,"abstract":"","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"24 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78099922","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
首页 上一页
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学术官方微信