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

2014 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Rewritable coset coding for flash memories 闪存的可重写coset编码
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875200
Y. M. Chee, H. M. Kiah, Punarbasu Purkayastha
{"title":"Rewritable coset coding for flash memories","authors":"Y. M. Chee, H. M. Kiah, Punarbasu Purkayastha","doi":"10.1109/ISIT.2014.6875200","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875200","url":null,"abstract":"Flash memory is a nonvolatile memory technology that suffers from errors due to charge leakage, can tolerate limited erasures, and where erasures have to be performed in large blocks. We show that using cosets of a linear code can provide correction against uniform charge leakage, and can enhance the rewritability of flash memory which leads to fewer erasures. We introduce two coset coding schemes that are generalizations of the scheme in Jacobvitz et al. (2013). For the same worst case rewrite cost, we show that coset codes can encode more information than rank modulation codes. The average case performance of coset codes is demonstrated via numerical simulations.","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":"124985919","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
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
Determining the convergence of variance in Gaussian belief propagation via semi-definite programming 用半定规划方法确定高斯信念传播中方差的收敛性
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875307
Qinliang Su, Yik-Chung Wu
{"title":"Determining the convergence of variance in Gaussian belief propagation via semi-definite programming","authors":"Qinliang Su, Yik-Chung Wu","doi":"10.1109/ISIT.2014.6875307","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875307","url":null,"abstract":"In order to compute the marginal distribution from a high dimensional distribution with loopy Gaussian belief propagation (BP), it is important to determine whether Gaussian BP would converge. In general, the convergence condition for Gaussian BP variance and mean are not necessarily the same, and this paper focuses on the convergence condition of Gaussian BP variance. In particular, by describing the message-passing process of Gaussian BP as a set of updating functions, the necessary and sufficient convergence condition of Gaussian BP variance is derived, with the converged variance proved to be independent of the initialization as long as it is greater or equal to zero. It is further proved that the convergence condition can be verified efficiently by solving a semi-definite programming (SDP) optimization problem. Numerical examples are presented to corroborate the established theories.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"47 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":"128276461","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
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
Design of non-precoded protograph-based LDPC codes 基于非预编码原型的LDPC代码设计
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875340
H. Uchikawa
{"title":"Design of non-precoded protograph-based LDPC codes","authors":"H. Uchikawa","doi":"10.1109/ISIT.2014.6875340","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875340","url":null,"abstract":"A new family of protograph-based codes with no punctured variable nodes is presented. The codes are constructed by using differential evolution, partial brute force search, and the lengthening method introduced by Nguyen et al.. The protograph ensembles satisfy the linear minimum distance growth property and have the lowest iterative decoding thresholds yet reported in the literature among protograph codes without punctured variable nodes. Simulation results show that the new codes perform better than state-of-the-art protograph codes when the number of decoding iterations is small.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"38 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":"124432155","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}
引用次数: 34
Two-unicast is hard 双单播很难
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875213
Sudeep Kamath, David Tse, Chih-Chun Wang
{"title":"Two-unicast is hard","authors":"Sudeep Kamath, David Tse, Chih-Chun Wang","doi":"10.1109/ISIT.2014.6875213","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875213","url":null,"abstract":"Consider the k-unicast network coding problem over an acyclic wireline network: Given a rate vector k-tuple, determine whether the network of interest can support k unicast flows with those rates. It is well known that the one-unicast problem is easy and that it is solved by the celebrated max-flow min-cut theorem. The hardness of k-unicast problems with small k has been an open problem. We show that the two-unicast problem is as hard as any k-unicast problem for k ≥ 3. Our result suggests that the difficulty of a network coding instance is related more to the magnitude of the rates in the rate tuple than to the number of unicast sessions. As a consequence of our result and other well-known results, we show that linear coding is insufficient to achieve capacity, and non-Shannon inequalities are necessary for characterizing capacity, even for two-unicast networks.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"59 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":"128274229","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
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
Constructions a of lattices from number fields and division algebras 从数域和除法代数构造格
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875249
R. Vehkalahti, Wittawat Kositwattanarerk, F. Oggier
{"title":"Constructions a of lattices from number fields and division algebras","authors":"R. Vehkalahti, Wittawat Kositwattanarerk, F. Oggier","doi":"10.1109/ISIT.2014.6875249","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875249","url":null,"abstract":"There is a rich theory of relations between lattices and linear codes over finite fields. However, this theory has been developed mostly with lattice codes for the Gaussian channel in mind. In particular, different versions of what is called Construction A have connected the Hamming distance of the linear code to the Euclidean structure of the lattice. This paper concentrates on developing a similar theory, but for fading channel coding instead. First, two versions of Construction A from number fields are given. These are then extended to division algebra lattices. Instead of the Euclidean distance, the Hamming distance of the finite codes is connected to the product distance of the resulting lattices, that is the minimum product distance and the minimum determinant respectively.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"34 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113988380","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
首页 上一页 下一页 尾页
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学术官方微信
小红书