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

2014 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Distributed decode-forward for multicast 用于组播的分布式解码转发
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874910
S. Lim, Kwang Taik Kim, Young-Han Kim
{"title":"Distributed decode-forward for multicast","authors":"S. Lim, Kwang Taik Kim, Young-Han Kim","doi":"10.1109/ISIT.2014.6874910","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874910","url":null,"abstract":"A new coding scheme for multicasting a message over a general relay network is presented that extends both network coding for graphical networks by Ahlswede, Cai, Li, and Yeung, and partial decode-forward for relay channels by Cover and El Gamal. For the N-node Gaussian multicast network, the scheme achieves within 0.5N bits from the capacity, improving upon the best known capacity gap results. The key idea is to use multicoding at the source as in Marton coding for broadcast channels. Instead of recovering a specific part of the message as in the original partial decode-forward scheme, a relay in the proposed distributed decode-forward scheme recovers an auxiliary index that implicitly carries some information about the message and forwards it in block Markov coding. This scheme can be adapted to broadcasting multiple messages over a general relay network, extending and refining a recent result by Kannan, Raja, and Viswanath.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"23 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":"115499853","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}
引用次数: 31
Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics 广义Kendall tau和Cayley度量中的断点分析和排列码
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875376
Y. M. Chee, Van Khu Vu
{"title":"Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics","authors":"Y. M. Chee, Van Khu Vu","doi":"10.1109/ISIT.2014.6875376","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875376","url":null,"abstract":"Permutation codes under the Cayley, Kendall tau, and Ulam metrics have been studied recently due to applications in flash memories. We consider permutation codes under more general metrics. We use breakpoints in permutations to gain additional insights to distances in codes. As a result, we construct codes under these general metrics that are larger than those previously known under more restricted metrics.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"221 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":"124301208","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}
引用次数: 12
Strong converse for the capacity of quantum Gaussian channels 量子高斯信道容量的强逆
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874928
Bhaskar Roy Bardhan, R. García-Patrón, M. Wilde, A. Winter
{"title":"Strong converse for the capacity of quantum Gaussian channels","authors":"Bhaskar Roy Bardhan, R. García-Patrón, M. Wilde, A. Winter","doi":"10.1109/ISIT.2014.6874928","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874928","url":null,"abstract":"We prove that a strong converse theorem holds for the classical capacity of all phase-insensitive bosonic Gaussian channels, when imposing a maximum photon number constraint on the inputs of the channel. This class is a natural extension of classical continuous Gaussian channels, and the well studied pure-loss, thermal, additive noise, and amplifier channels are all in this class of channels. The statement of the strong converse theorem is that the probability of correctly decoding a classical message rapidly converges to zero in the limit of many channel uses if the communication rate exceeds the classical capacity. We prove this theorem by relating the success probability of any code with its rate of data transmission, the effective dimension of the channel output space, and the purity of the channel as quantified by the minimum output entropy. Our result bolsters the understanding of the classical capacity of these channels by establishing it as a sharp dividing line between possible and impossible communication rates over them.","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":"126320632","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
Constructing Boolean functions with potentially optimal algebraic immunity based on additive decompositions of finite fields (extended abstract) 基于有限域加性分解构造具有潜在最优代数免疫的布尔函数(扩展摘要)
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875055
Baofeng Wu, Qingfang Jin, Zhuojun Liu, D. Lin
{"title":"Constructing Boolean functions with potentially optimal algebraic immunity based on additive decompositions of finite fields (extended abstract)","authors":"Baofeng Wu, Qingfang Jin, Zhuojun Liu, D. Lin","doi":"10.1109/ISIT.2014.6875055","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875055","url":null,"abstract":"We propose a general approach to construct cryptographic significant Boolean functions of (r + 1)m variables based on the additive decomposition F2rm × F2m of the finite field F2(r+1)m, where r ≥ 1 is odd and m ≥ 3. A class of unbalanced functions is constructed first via this approach, which coincides with a variant of the unbalanced class of generalized Tu-Deng functions in the case r = 1. Functions belonging to this class have high algebraic degree, but their algebraic immunity does not exceed m, which is impossible to be optimal when r > 1. By modifying these unbalanced functions, we obtain a class of balanced functions which have optimal algebraic degree and high nonlinearity (shown by a lower bound we prove). These functions have optimal algebraic immunity provided a combinatorial conjecture on binary strings which generalizes the Tu-Deng conjecture is true. Computer investigations show that, at least for small values of number of variables, functions from this class also behave well against fast algebraic attacks.","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":"130117772","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
Interference mitigation and signal enhancement for K-user MIMO interference channels k -用户MIMO干扰信道的干扰缓解和信号增强
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875403
Xiaohu Shang
{"title":"Interference mitigation and signal enhancement for K-user MIMO interference channels","authors":"Xiaohu Shang","doi":"10.1109/ISIT.2014.6875403","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875403","url":null,"abstract":"The optimal signaling for K-user multiple-antenna Gaussian interference channels with single-user detection has been studied. It is shown that to achieve the boundary of the rate region, the rank of the optimal input covariance matrix is no greater than the rank of the direct link channel matrix as long as this transmitter has perfect channel state information of its direct link. Based on this, interference mitigation and signal enhancement are derived and shown to be necessary conditions for the optimal signaling. Different power constraints and channel availability scenarios are also considered.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"s3-29 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":"130123580","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 impact of dark current on the wideband Poisson channel 暗电流对宽带泊松信道的影响
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875369
Ligong Wang, G. Wornell
{"title":"The impact of dark current on the wideband Poisson channel","authors":"Ligong Wang, G. Wornell","doi":"10.1109/ISIT.2014.6875369","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875369","url":null,"abstract":"We study the discrete-time Poisson channel under the constraint that its average input power (in photons per channel use) must not exceed some constant ε. We consider the wideband, high-photon-efficiency extreme where ε approaches zero, and where the channel's “dark current” approaches zero proportionally with ε. Extending our previous work, we show that the influence of the dark current on channel capacity is mainly on the third-order term with respect to ε. We also show that pulse-position modulation with “soft-decision decoding” achieves data rates that accurately reflect such influence.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"26 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":"129288407","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
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
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
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
Degrees of freedom of interference channel with rank-deficient transfer matrix 具有秩亏转移矩阵的干扰信道的自由度
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875027
Abinesh Ramakrishnan, S. Krishnamurthy, S. Jafar, Yaming Yu
{"title":"Degrees of freedom of interference channel with rank-deficient transfer matrix","authors":"Abinesh Ramakrishnan, S. Krishnamurthy, S. Jafar, Yaming Yu","doi":"10.1109/ISIT.2014.6875027","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875027","url":null,"abstract":"We consider the interference channel with K transmitters and K receivers all having a single antenna, wherein the K × K transfer matrix representing this channel has rank D (D <; K) . The degrees of freedom (DoF) of such channels are not known as the rank deficiency in the transfer matrix creates algebraic dependencies between the channel coefficients. We present a modified version of the [CJ08] alignment scheme, to handle these dependencies while aligning interference, and state the sufficient conditions for achieving half rate per user using this scheme. The difficulties in proving these sufficient conditions are shown for K = 4 and K = 5. We also show that these sufficient conditions are not satisfied for K ≥ 6.","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":"131288344","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
首页 上一页 下一页 尾页
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学术官方微信