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

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

筛选
英文 中文
Zero-Error Capacity of Multiple Access Channels via Nonstochastic Information 基于非随机信息的多址信道零误差容量
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989045
Ghassen Zafzouf, G. Nair, J. Evans
{"title":"Zero-Error Capacity of Multiple Access Channels via Nonstochastic Information","authors":"Ghassen Zafzouf, G. Nair, J. Evans","doi":"10.1109/ITW44776.2019.8989045","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989045","url":null,"abstract":"The problem of characterising the zero-error capacity region for multiple access channels even in the noiseless case has remained an open problem for over three decades. Motivated by this challenging question, a recently developed theory of nonstochastic information is applied to characterise the zero-error capacity region for the case of two correlated transmitters. Unlike previous contributions, this analysis does not assume that the blocklength is asymptotically large. Finally, a new notion of nonstochastic information is proposed for a non-cooperative problem involving three agents. These results are preliminary steps towards understanding information flows in worst-case distributed estimation and control problems.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 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":"129609440","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
Invariance pressure for linear discrete-time systems 线性离散系统的不变性压力
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989280
F. Colonius, João A. N. Cossich, A. Santana
{"title":"Invariance pressure for linear discrete-time systems","authors":"F. Colonius, João A. N. Cossich, A. Santana","doi":"10.1109/ITW44776.2019.8989280","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989280","url":null,"abstract":"For linear control systems in discrete time controllability properties are characterized. In particular, a unique control set with nonvoid interior exists. The main result is a formula for the invariance pressure of this control set.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 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":"130245206","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 Upper Bound on the Capacity of the DNA Storage Channel DNA存储通道容量的上限
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989388
A. Lenz, P. Siegel, A. Wachter-Zeh, Eitan Yaakobi
{"title":"An Upper Bound on the Capacity of the DNA Storage Channel","authors":"A. Lenz, P. Siegel, A. Wachter-Zeh, Eitan Yaakobi","doi":"10.1109/ITW44776.2019.8989388","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989388","url":null,"abstract":"Paved by recent advances in sequencing and synthesis technologies, DNA has evolved to a competitive medium for long-term data storage. In this paper we conduct an information theoretic study of the storage channel-the entity that formulates the relation between stored and sequenced strands. In particular, we derive an upper bound on the Shannon capacity of the channel. In our channel model, we incorporate the main attributes that characterize DNA-based data storage. That is, information is synthesized on many short DNA strands, and each strand is copied many times. Due to the storage and sequencing methods, the receiver draws strands from the original sequences in an uncontrollable manner, where it is possible that copies of the same sequence are drawn multiple times. Additionally, due to imperfections, the obtained strands can be perturbed by errors. We show that for a large range of parameters, the channel decomposes into sub-channels from each input sequence to multiple output sequences, so-called clusters. The cluster sizes hereby follow a Poisson distribution. Furthermore, the ordering of sub-channels is unknown to the receiver. Our results can be used to guide future experiments for DNA-based data storage by giving an upper bound on the achievable rate of any error-correcting code. We further give a detailed discussion and intuitive interpretation of the channel that provide insights about the nature of the channel and can inspire new ideas for error-correcting codes and decoding methods.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"22 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":"121388451","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}
引用次数: 25
Closed-Form Expression for the Average Age of Information in a Multi-Source M/G/1 Queueing Model 多源M/G/1排队模型中信息平均年龄的封闭表达式
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989346
Mohammad Moltafet, Markus Leinonen, M. Codreanu
{"title":"Closed-Form Expression for the Average Age of Information in a Multi-Source M/G/1 Queueing Model","authors":"Mohammad Moltafet, Markus Leinonen, M. Codreanu","doi":"10.1109/ITW44776.2019.8989346","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989346","url":null,"abstract":"In the context of the next generation wireless networks, freshness of status update packets is essential for enabling the services where a destination needs the most recent measurements of various sensors. In this paper, we study the information freshness of a multi-source M/G/1 first-come first-served (FCFS) queueing model, where each source independently generates status update packets according to a Poisson process. The information freshness of the status updates of each source is evaluated using the average age of information (AoI). To this end, we derive a closed-form expression for the average AoI of each source. As particular cases of our general expressions, we also derive closed-form expressions of the average AoI for both multi-source M/M/1 and single-source M/G/1 queueing models.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"150 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":"122758662","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}
引用次数: 23
Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing Schemes 与任何线性秘密共享方案相比的强安全斜坡秘密共享方案
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989107
Reo Eriguchi, N. Kunihiro
{"title":"Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing Schemes","authors":"Reo Eriguchi, N. Kunihiro","doi":"10.1109/ITW44776.2019.8989107","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989107","url":null,"abstract":"A secret sharing scheme (SSS) is a cryptographic tool to protect a secret from loss and leakage by dividing it into shares. A ramp SSS can improve the efficiency in terms of the sizes of shares by allowing partial information about the secret to leak out. In order to prevent the partial information from being recovered explicitly, the notion of the strong security has been introduced. However, there have been proposed few methods to construct strongly secure ramp SSSs for general access structures and they are not always sufficient. In this paper, we show that any linear ramp SSS can be transformed into a strongly secure scheme with the same access structure preserving the information ratio.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"78 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":"127713386","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
Weakly Secure Symmetric Multilevel Diversity Coding 弱安全对称多电平分集编码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989083
Tao Guo, C. Tian, Tie Liu, R. Yeung
{"title":"Weakly Secure Symmetric Multilevel Diversity Coding","authors":"Tao Guo, C. Tian, Tie Liu, R. Yeung","doi":"10.1109/ITW44776.2019.8989083","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989083","url":null,"abstract":"Multilevel diversity coding is a classical coding model where multiple mutually independent information messages are encoded, such that different reliability requirements can be afforded to different messages. It is well known that superposition coding, namely separately encoding the independent messages, is optimal for symmetric multilevel diversity coding (SMDC) (Yeung-Zhang 1999). In the current paper, we consider weakly secure SMDC where secrecy constraints are injected on each individual message, and provide a complete characterization of the conditions under which superposition coding is sum-rate optimal. Two joint coding strategies, which lead to rate savings compared to superposition coding, are proposed, where some coding components for one message can be used as the encryption key for another. By applying different variants of Han’s inequality, we show that the lack of opportunities to apply these two coding strategies directly implies the optimality of superposition coding. It is further shown that under a particular security configuration, one of the proposed joint coding strategies can be used to achieve the optimal sum rate.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"3 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":"127799659","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
Secrecy Capacity of a Gaussian Wiretap Channel with One-bit ADCs is Always Positive 具有1位adc的高斯窃听信道的保密能力总是正的
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8988965
S. Nam, Si-Hyeon Lee
{"title":"Secrecy Capacity of a Gaussian Wiretap Channel with One-bit ADCs is Always Positive","authors":"S. Nam, Si-Hyeon Lee","doi":"10.1109/ITW44776.2019.8988965","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8988965","url":null,"abstract":"We consider the Gaussian wiretap channel with one-bit analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. In this channel, we show that a positive secrecy rate is always achievable whenever the noise power $n_{1}^{2}$ at the legitimate receiver is not the same as the noise power $n_{2}^{2}$ at the eavesdropper. A binary phase-shift keying (BPSK) and an asymmetric BPSK are shown to achieve a positive secrecy rate for the cases of $n_{1} < n_{2}$ and $n_{1} > n_{2}$, respectively. We partially justify the choice of these signalings by showing that the optimal input distribution that achieves $R_{s}^{*}:= displaystyle sup _{P_{X}:mathrm {E}[X^{2}]leq P}I(X;Y_{1}) -I(X;Y_{2})$, where $X$ is the channel input with power constraint of $P$, and $Y_{1}$ and $Y_{2}$ are the channel outputs at the legitimate receiver and the eavesdropper, respectively, should satisfy some symmetric and asymmetric properties for the cases of $n_{1} < n_{2}$ and $n_{1} > n_{2}$, respectively. Moreover, for $n_{1} < n_{2}$ and sufficiently large $P$, it is shown that a BPSK using power smaller than $P$ achieves $R_{s}^{*}$.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"202 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":"132839802","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
Coded Caching with Optimized Shared-Cache Sizes 优化共享缓存大小的编码缓存
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989173
Emanuele Parrinello, P. Elia
{"title":"Coded Caching with Optimized Shared-Cache Sizes","authors":"Emanuele Parrinello, P. Elia","doi":"10.1109/ITW44776.2019.8989173","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989173","url":null,"abstract":"This work studies the K-user broadcast channel where each user is assisted by one of $Lambda$ caches with a cumulative memory constraint that is equal to t times the size of the library, and where each cache serves an arbitrary number of users. In this setting, under the assumption of uncoded cache placement, no prior scheme is known to achieve a sum degrees of freedom $(mathrm{D}mathrm{o}$F) of $t+1$, other than in the uniform case where all caches serve an equal number of users. We here show for the first time that allowing an optimized memory allocation across the caches as a function of the number of users served per cache, provides for the aforementioned DoF. A subsequent index-coding based converse proves that this performance can be close to optimal for bounded values of t.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"18 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":"133726976","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
On the Fundamental Limits of Cooperative Multiple-Access Channels with Distributed CSIT 基于分布式CSIT的合作多址信道的基本限制
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989227
Lorenzo Miretti, Paul de Kerret, D. Gesbert
{"title":"On the Fundamental Limits of Cooperative Multiple-Access Channels with Distributed CSIT","authors":"Lorenzo Miretti, Paul de Kerret, D. Gesbert","doi":"10.1109/ITW44776.2019.8989227","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989227","url":null,"abstract":"The availability of accurate and, most importantly, shared channel state information at the transmitter (CSIT) is one of the key factors that enable transmitters cooperation in decentralized wireless systems. However, in some cases, channel information may not be easily or perfectly shared among the transmitters, thus limiting their coordination capabilities. In this paper we shed some light on the fundamental limits of networks with cooperating transmitters impaired by a general distributed CSIT assumption. To this end, we consider a state-dependent memory-less multiple-access channel with common message, and with noisy causal CSIT and noisy channel state information at the receiver (CSIR). Perhaps surprisingly, and in contrast to the same setting in absence of common message, we show that distributed precoding based on current CSIT only (namely, a Shannon strategy) achieves the sum-rate capacity of this channel, for every degree of CSIT and CSIR. By focusing on the transmission of a common message only, we then illustrate this result in a practically relevant Gaussian setting.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"372 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":"133994222","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
Improved decoding of second-order Reed-Muller codes 改进的二阶Reed-Muller码解码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8988970
K. Ivanov, R. Urbanke
{"title":"Improved decoding of second-order Reed-Muller codes","authors":"K. Ivanov, R. Urbanke","doi":"10.1109/ITW44776.2019.8988970","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8988970","url":null,"abstract":"In this paper, we consider low-complexity decoding of second-order Reed-Muller codes. A class of polynomial-time algorithms, based on the projections onto first-order codes, is studied. An old representative of this class, originally developed for binary symmetric channel, is brought back to life and applied for AWGN channel. Some improvements are proposed, which bring the performance closer to ML bound with lower complexity compared to other algorithms. Another potentially fruitful property is returning the list of codewords. In addition, a simple method for complexity reduction and its impact on the performance are demonstrated.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"139 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":"131841191","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
首页 上一页 下一页 尾页
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学术官方微信