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

2015 IEEE Information Theory Workshop - Fall (ITW)最新文献

筛选
英文 中文
Repair scheduling in wireless distributed storage with D2D communication 基于D2D通信的无线分布式存储维修调度
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-04-23 DOI: 10.1109/ITWF.2015.7360736
Jesper Pedersen, A. G. Amat, I. Andriyanova, F. Brannstrom
{"title":"Repair scheduling in wireless distributed storage with D2D communication","authors":"Jesper Pedersen, A. G. Amat, I. Andriyanova, F. Brannstrom","doi":"10.1109/ITWF.2015.7360736","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360736","url":null,"abstract":"We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a piece of content, a user retrieves the content from the mobile devices using device-to-device communication or, if not possible, from the base station (BS), at the expense of a higher communication cost. We consider the repair problem when a device that stores data leaves the network. In particular, we introduce a repair scheduling where repair is performed (from storage devices or the BS) periodically. We derive analytical expressions for the overall communication cost of repair and download as a function of the repair interval. We illustrate the analysis by giving results for maximum distance separable codes and regenerating codes. Our results indicate that DS can reduce the overall communication cost with respect to the case where content is only downloaded from the BS, provided that repairs are performed frequently enough. The required repair frequency depends on the code used for storage and the network parameters. In particular, minimum bandwidth regenerating codes require frequent repairs, while maximum distance separable codes give better performance if repair is performed less frequently. We also show that instantaneous repair is not always optimal.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"49 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131721038","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}
引用次数: 16
Lossy compression with privacy constraints: Optimality of polar codes 具有隐私约束的有损压缩:极坐标码的最优性
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-04-21 DOI: 10.1109/ITWF.2015.7360759
F. Mokhtarinezhad, J. Kliewer, O. Simeone
{"title":"Lossy compression with privacy constraints: Optimality of polar codes","authors":"F. Mokhtarinezhad, J. Kliewer, O. Simeone","doi":"10.1109/ITWF.2015.7360759","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360759","url":null,"abstract":"A lossy source coding problem with privacy constraint is studied in which two correlated discrete sources X and Y are compressed into a reconstruction X̂ with some prescribed distortion D. In addition, a privacy constraint is specified as the equivocation between the lossy reconstruction X̂ and Y. This models the situation where a certain amount of source information from one user is provided as utility (given by the fidelity of its reconstruction) to another user or the public, while some other correlated part of the source information Y must be kept private. In this work, we show that polar codes are able, possibly with the aid of time sharing, to achieve any point in the optimal rate-distortion-equivocation region identified by Yamamoto, thus providing a constructive scheme that obtains the optimal tradeoff between utility and privacy in this framework.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127732253","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
Fully quantum source compression with a quantum helper 完全量子源压缩与量子助手
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-04-20 DOI: 10.1109/ITWF.2015.7360785
Min-Hsiu Hsieh, Shun Watanabe
{"title":"Fully quantum source compression with a quantum helper","authors":"Min-Hsiu Hsieh, Shun Watanabe","doi":"10.1109/ITWF.2015.7360785","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360785","url":null,"abstract":"We study source compression with a helper in the fully quantum regime, extending our earlier result on classical source compression with a quantum helper [arXiv:1501.04366, 2015]. We characterise the quantum resources involved in this problem, and derive a single-letter expression of the achievable rate region when entanglement assistance is available. The direct coding proof is based on a combination of two fundamental protocols, namely the quantum state merging protocol and the quantum reverse Shannon theorem (QRST). This result connects distributed source compression with the QRST protocol, a quantum protocol that consumes noiseless resources to simulate a noisy quantum channel.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127958890","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
Generalized interlinked cycle cover for index coding 索引编码的广义互联循环覆盖物
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-04-19 DOI: 10.1109/ITWF.2015.7360723
Chandra Thapa, L. Ong, Sarah J. Johnson
{"title":"Generalized interlinked cycle cover for index coding","authors":"Chandra Thapa, L. Ong, Sarah J. Johnson","doi":"10.1109/ITWF.2015.7360723","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360723","url":null,"abstract":"A source coding problem over a noiseless broadcast channel where the source is preinformed about the contents of the cache of all receivers, is an index coding problem. Furthermore, if each message is requested by one receiver, then we call this an index coding problem with a unicast message setting. This problem can be represented by a directed graph. In this paper, we first define a structure (we call generalized interlinked cycle (GIC)) in directed graphs. A GIC consists of cycles which are interlinked in some manner (i.e., not disjoint), and it turns out that the GIC is a generalization of cliques and cycles. We then propose a simple scalar linear encoding scheme with linear time encoding complexity. This scheme exploits GICs in the digraph. We prove that our scheme is optimal for a class of digraphs with message packets of any length. Moreover, we show that our scheme can outperform existing techniques, e.g., partial clique cover, local chromatic number, composite-coding, and interlinked cycle cover.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128521243","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}
引用次数: 11
Dirty paper arbitrarily varying channel with a state-aware adversary 脏纸与状态感知对手任意改变通道
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-04-16 DOI: 10.1109/ITWF.2015.7360741
Amitalok J. Budkuley, B. Dey, V. Prabhakaran
{"title":"Dirty paper arbitrarily varying channel with a state-aware adversary","authors":"Amitalok J. Budkuley, B. Dey, V. Prabhakaran","doi":"10.1109/ITWF.2015.7360741","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360741","url":null,"abstract":"In this paper, we take an arbitrarily varying channel (AVC) approach to examine the problem of writing on a dirty paper in the presence of an adversary. We consider an additive white Gaussian noise (AWGN) channel with an additive white Gaussian state, where the state is known non-causally to the encoder and the adversary, but not the decoder. We determine the randomized coding capacity of this AVC under the maximal probability of error criterion. Interestingly, it is shown that the jamming adversary disregards the state knowledge to choose a white Gaussian channel input which is independent of the state.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133269929","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
A low-complexity message recovery method for Compute-and-Forward relaying 一种用于计算机转发中继的低复杂度消息恢复方法
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-04-13 DOI: 10.1109/ITWF.2015.7360730
Amaro Barreal, Joonas Pääkkönen, David A. Karpuk, C. Hollanti, O. Tirkkonen
{"title":"A low-complexity message recovery method for Compute-and-Forward relaying","authors":"Amaro Barreal, Joonas Pääkkönen, David A. Karpuk, C. Hollanti, O. Tirkkonen","doi":"10.1109/ITWF.2015.7360730","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360730","url":null,"abstract":"The Compute-and-Forward relaying strategy aims to achieve high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the messages to decode, there is no guarantee that the overall system of linear equations is solvable at the destination. In this article it is shown that, for a Gaussian fading channel model with two transmitters and two relays, always choosing the combination that maximizes the computation rate often leads to a case where the original messages cannot be recovered. It is further shown that by limiting the relays to select from carefully designed sets of equations, a solvable system can be guaranteed while maintaining high computation rates. The proposed method has a constant computational complexity and requires no information exchange between the relays.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133173560","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}
引用次数: 7
Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabets 有限字母的相对熵和rsamnyi散度作为总变异距离函数的上界
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-03-11 DOI: 10.1109/ITWF.2015.7360766
I. Sason, S. Verdú
{"title":"Upper bounds on the relative entropy and Rényi divergence as a function of total variation distance for finite alphabets","authors":"I. Sason, S. Verdú","doi":"10.1109/ITWF.2015.7360766","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360766","url":null,"abstract":"A new upper bound on the relative entropy is derived as a function of the total variation distance for probability measures defined on a common finite alphabet. The bound improves a previously reported bound by Csiszár and Talata. It is further extended to an upper bound on the Rényi divergence of an arbitrary non-negative order (including ∞) as a function of the total variation distance.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130858371","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}
引用次数: 29
Noisy channel-output feedback capacity of the linear deterministic interference channel 噪声信道-线性确定性干扰信道的输出反馈容量
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-02-16 DOI: 10.1109/ITWF.2015.7360740
Víctor Quintero, S. Perlaza, J. Gorce
{"title":"Noisy channel-output feedback capacity of the linear deterministic interference channel","authors":"Víctor Quintero, S. Perlaza, J. Gorce","doi":"10.1109/ITWF.2015.7360740","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360740","url":null,"abstract":"In this paper, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios in which implementing channel-output feedback in only one of the transmitter-receiver pairs is as beneficial as implementing it in both links, in terms of achievable individual rate and sum-rate improvements w.r.t. the case without feedback. In other scenarios, the use of channel-output feedback in any of the transmitter-receiver pairs benefits only one of the two pairs in terms of achievable individual rate improvements or simply, it turns out to be useless, i.e., the capacity regions with and without feedback turn out to be identical even in the full absence of noise in the feedback links.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128612115","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
Erasure codes with symbol locality and group decodability for distributed storage 分布式存储中具有符号局部性和组可解码性的擦除码
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-02-03 DOI: 10.1109/ITWF.2015.7360737
Wentu Song, Son Hoang Dau, C. Yuen
{"title":"Erasure codes with symbol locality and group decodability for distributed storage","authors":"Wentu Song, Son Hoang Dau, C. Yuen","doi":"10.1109/ITWF.2015.7360737","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360737","url":null,"abstract":"We introduce a new family of erasure codes, called group decodable code (GDC), for distributed storage system. Given a set of design parameters {α, β, k, t}, where k is the number of information symbols, each codeword of an (α, β, k, t)- group decodable code is a t-tuple of strings, called buckets, such that each bucket is a string of β symbols that is a codeword of a [β, α] MDS code (which is encoded from α information symbols). Such codes have the following two properties: (P1) Locally Repairable: Each code symbol has locality (α, β - α + 1). (P2) Group decodable: From each bucket we can decode α information symbols. We establish an upper bound of the minimum distance of (α, β, k, t)-group decodable code for any given set of {α, β, k, t}; We also prove that the bound is achievable when the coding field F has size |F| > (<sup>n-1</sup><sub>k-1</sub> ).","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129822050","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 the secrecy exponent of the wire-tap channel 关于窃听通道的保密指数
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-01-26 DOI: 10.1109/ITWF.2015.7360781
Mani Bastani Parizi, E. Telatar
{"title":"On the secrecy exponent of the wire-tap channel","authors":"Mani Bastani Parizi, E. Telatar","doi":"10.1109/ITWF.2015.7360781","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360781","url":null,"abstract":"We derive an exponentially decaying upper-bound on the unnormalized amount of information leaked to the wire-tapper in Wyner's wire-tap channel setting. We characterize the exponent of the bound as a function of the randomness used by the encoder. This exponent matches that of the recent work of Hayashi [12] which is, to the best of our knowledge, the best exponent that exists in the literature. Our proof (like those of [17], [18]) is exclusively based on an i.i.d. random coding construction while that of [12], in addition, requires the use of random universal hash functions.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124691059","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
首页 上一页 下一页 尾页
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学术官方微信