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

2014 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Effect of message transmission diversity on status age 信息传递多样性对状态年龄的影响
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875266
C. Kam, S. Kompella, A. Ephremides
{"title":"Effect of message transmission diversity on status age","authors":"C. Kam, S. Kompella, A. Ephremides","doi":"10.1109/ISIT.2014.6875266","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875266","url":null,"abstract":"We investigate the performance of a status monitoring system, in which a sensor sends random status updates over a network to a remote monitor. Specifically, we analyze the status age metric, which characterizes how old the information at the monitor is from the last received status update. The system on which we focus is a single queue with 2 servers (specifically, an M/M/2). In a dynamic network, different status packets may take different routes to the monitor, which allows for the possibility of packets arriving out of order. In the case of the status monitoring system, only the latest status is useful. Studying a system with 2 servers allows for the possibility of packets to arrive out-of-order while still having to queue. We present the exact approach to computing the analytical status age, and we provide an approximation that matches very closely with the simulated age. We also compare with the M/M/∞ and M/M/1, and we demonstrate the tradeoff between status age and network resource consumption.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127673742","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}
引用次数: 76
Capacity of the discrete memoryless energy harvesting channel with side information 具有侧信息的离散无记忆能量收集信道的容量
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874942
Omur Ozel, Kaya Tutuncuoglu, S. Ulukus, A. Yener
{"title":"Capacity of the discrete memoryless energy harvesting channel with side information","authors":"Omur Ozel, Kaya Tutuncuoglu, S. Ulukus, A. Yener","doi":"10.1109/ISIT.2014.6874942","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874942","url":null,"abstract":"We determine the capacity of a discrete memoryless communication channel with an energy harvesting transmitter and its battery state information available at the transmitter and the receiver. This capacity is an upper bound for the problem where side information is available only at the transmitter. Since channel output feedback does not increase the capacity in this case, we equivalently study the resulting finite-state Markov channel with feedback. We express the capacity in terms of directed information. Additionally, we provide sufficient conditions under which the capacity expression is further simplified to include the stationary distribution of the battery state. We also obtain a single-letter expression for the capacity with battery state information at both sides and an infinite-sized battery. Lastly, we consider achievable schemes when side information is available only at the transmitter for the case of an arbitrary finite-sized battery. We numerically evaluate the capacity and achievable rates with and without receiver side information.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"61 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120888863","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}
引用次数: 18
On storage codes allowing partially collaborative repairs 存储代码允许部分协作修复
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875272
Shiqiu Liu, F. Oggier
{"title":"On storage codes allowing partially collaborative repairs","authors":"Shiqiu Liu, F. Oggier","doi":"10.1109/ISIT.2014.6875272","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875272","url":null,"abstract":"We consider the design of codes for distributed storage systems that are amenable to repair. We introduce the notion of partial collaboration to capture the property that nodes participating in a repair process may collaborate to different extents, bringing more nuances to the known cases: no collaboration or full collaboration during repair. We compute for this scenario the storage (per node) when the repair bandwidth (per node) is minimal, and conversely the repair bandwidth when the storage is minimal. We provide a generic code construction that enables repair of several failures through partial collaboration.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120944957","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}
引用次数: 10
Weakly secure data exchange with Generalized Reed Solomon codes 用广义Reed Solomon码进行弱安全数据交换
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875056
M. Yan, A. Sprintson, I. Zelenko
{"title":"Weakly secure data exchange with Generalized Reed Solomon codes","authors":"M. Yan, A. Sprintson, I. Zelenko","doi":"10.1109/ISIT.2014.6875056","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875056","url":null,"abstract":"We focus on secure data exchange among a group of wireless clients. The clients exchange data by broadcasting linear combinations of packets over a lossless channel. The data exchange is performed in the presence of an eavesdropper who has access to the channel and can obtain all transmitted data. Our goal is to develop a weakly secure coding scheme that prevents the eavesdropper from being able to decode any of the original packets held by the clients. We present a randomized algorithm based on Generalized Reed-Solomon (GRS) codes. The algorithm has two key advantages over the previous solutions: it operates over a small (polynomial-size) finite field and provides a way to verify that constructed code is feasible. In contrast, the previous approaches require exponential field size and do not provide an efficient (polynomial-time) algorithm to verify the secrecy properties of the constructed code. We formulate an algebraic-geometric conjecture that implies the correctness of our algorithm and prove its validity for special cases. Our simulation results indicate that the algorithm is efficient in practical settings.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121118419","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}
引用次数: 41
Capacity approximation of memoryless channels with countable output alphabets 具有可计数输出字母的无记忆信道的容量近似
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875366
Tobias Sutter, Peyman Mohajerin Esfahani, David Sutter, J. Lygeros
{"title":"Capacity approximation of memoryless channels with countable output alphabets","authors":"Tobias Sutter, Peyman Mohajerin Esfahani, David Sutter, J. Lygeros","doi":"10.1109/ISIT.2014.6875366","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875366","url":null,"abstract":"We present a new algorithm, based on duality of convex programming and the specific structure of the channel capacity problem, to iteratively construct upper and lower bounds for the capacity of memoryless channels having continuous input and countable output alphabets. Under a mild assumption on the decay rate of the channel's tail, explicit bounds for the approximation error are provided. We demonstrate the applicability of our result on the discrete-time Poisson channel having a peak-power input constraint.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284511","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
Regenerating codes over a binary cyclic code 在二进制循环码上重新生成代码
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874992
K. Shum, Hanxu Hou, Minghua Chen, Huanle Xu, Hui Li
{"title":"Regenerating codes over a binary cyclic code","authors":"K. Shum, Hanxu Hou, Minghua Chen, Huanle Xu, Hui Li","doi":"10.1109/ISIT.2014.6874992","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874992","url":null,"abstract":"We present a design framework of regenerating codes for distributed storage systems which employ binary additions and bit-wise cyclic shifts as the basic operations. The proposed coding method can be regarded as a concatenation coding scheme with the outer code being a binary cyclic code, and the inner code a regenerating code utilizing the binary cyclic code as the alphabet set. The advantage of this approach is that encoding and repair of failed node can be done with low computational complexity. It is proved that the proposed coding method can achieve the fundamental tradeoff curve between the storage and repair bandwidth asymptotically when the size of the data file is large.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122271798","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}
引用次数: 15
On the asynchronous cognitive MAC 在异步认知MAC上
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875370
M. Yemini, A. Somekh-Baruch, Amir Leshem
{"title":"On the asynchronous cognitive MAC","authors":"M. Yemini, A. Somekh-Baruch, Amir Leshem","doi":"10.1109/ISIT.2014.6875370","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875370","url":null,"abstract":"We introduce the asynchronous cognitive multiple-access channel with an uninformed encoder and an informed one. We assume that the informed encoder knows in advance the message of the uninformed encoder and consequently its codeword, up to some delay. In addition, the informed encoder knows the set of all possible delays in the channel. We characterize the capacity region of the ACMAC in terms of multi-letter expressions. In addition, we present single-letter inner and outer bounds on the capacity region of this channel. We conclude by studying the special case of the Gaussian asynchronous multiple-access channels with an uninformed encoder.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126657460","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
Three-level storage and nested MDS codes for perfect secrecy in multiple clouds 三级存储和嵌套MDS代码，在多个云中实现完美的保密性
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875054
Ping Hu, C. Sung, Siu-Wai Ho, T. Chan
{"title":"Three-level storage and nested MDS codes for perfect secrecy in multiple clouds","authors":"Ping Hu, C. Sung, Siu-Wai Ho, T. Chan","doi":"10.1109/ISIT.2014.6875054","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875054","url":null,"abstract":"The problem of storing data reliably and securely in multiple cloud storage providers (CSPs) with minimum cost is investigated. A jointly optimal coding and storage allocation scheme, which achieves perfect secrecy with minimum cost, is derived. The optimal coding scheme is shown to be the nested maximum-distance-separable code and the optimal amounts of data to be stored in the CSPs is proven to exhibit a three-level structure. The exact parameters of the code and the exact storage amount to each CSP can be determined numerically by simple one-dimensional search.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126020385","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
Analysis of coupled scalar systems by displacement convexity 耦合标量系统的位移凸性分析
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875248
Rafah El-Khatib, N. Macris, T. Richardson, R. Urbanke
{"title":"Analysis of coupled scalar systems by displacement convexity","authors":"Rafah El-Khatib, N. Macris, T. Richardson, R. Urbanke","doi":"10.1109/ISIT.2014.6875248","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875248","url":null,"abstract":"Potential functionals have been introduced recently as an important tool for the analysis of coupled scalar systems (e.g. density evolution equations). In this contribution we investigate interesting properties of this potential. Using the tool of displacement convexity we show that, under mild assumptions on the system, the potential functional is displacement convex. Furthermore, we give the conditions on the system such that the potential is strictly displacement convex in which case the minimizer is unique.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120952012","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
Product construction of affine codes 仿射码的积构造
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1137/140976996
Y. M. Chee, H. M. Kiah, Punarbasu Purkayastha, P. Solé
{"title":"Product construction of affine codes","authors":"Y. M. Chee, H. M. Kiah, Punarbasu Purkayastha, P. Solé","doi":"10.1137/140976996","DOIUrl":"https://doi.org/10.1137/140976996","url":null,"abstract":"Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of binary linear codes. Additionally, the constructions have the property that they are systematic. Subsequently, we generalize our construction to irregular product of affine codes, where the component codes are affine codes of different rates.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124416314","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学术文献互助群
群 号：604180095
Book学术官方微信