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

2009 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Coding along Hermite polynomials for Gaussian noise channels 沿厄米特多项式编码高斯噪声信道
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205789
E. Abbe, Lizhong Zheng
{"title":"Coding along Hermite polynomials for Gaussian noise channels","authors":"E. Abbe, Lizhong Zheng","doi":"10.1109/ISIT.2009.5205789","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205789","url":null,"abstract":"This paper shows that the capacity achieving input distribution for a fading Gaussian broadcast channel is not Gaussian in general. The construction of non-Gaussian distributions that strictly outperform Gaussian ones, for certain characterized fading distributions, is provided. The ability of analyzing non-Gaussian input distributions with closed form expressions is made possible in a local setting. It is shown that there exists a specific coordinate system, based on Hermite polynomials, which parametrizes Gaussian neighborhoods and which is particularly suitable to study the entropic operators encountered with Gaussian noise.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"85 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131163696","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}
引用次数: 14
The quadratic Gaussian CEO problem with byzantine agents 拜占庭代理的二次高斯CEO问题
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206013
O. Kosut, L. Tong
{"title":"The quadratic Gaussian CEO problem with byzantine agents","authors":"O. Kosut, L. Tong","doi":"10.1109/ISIT.2009.5206013","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206013","url":null,"abstract":"The quadratic Gaussian CEO problem is studied when the agents are under Byzantine attack. That is, an unknown subset of agents is controlled by an adversary that attempts to damage the quality of the estimate at the Central Estimation Officer, or CEO. Inner and outer bounds are presented for the achievable rate region as a function of the fraction of adversarial agents. The inner bound is derived from a generalization of the Berger-Tung quantize-and-bin strategy, which has been shown to be tight in the non-Byzantine case. The outer bound has similarities to the Singleton bound in that the traitorous agents must be prevented from allowing two sources to result in the same transmitted codewords if their values are too far apart for the distortion constraint to be satisfied with a single estimate. The inner and outer bounds on the rate regions are used to find bounds on the asymptotic proportionality constant in the limit of a large number of agents and high sum-rate. These bounds on the proportionality constant differ at most by a factor of 4.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133592156","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
Decreasing error floor in LDPC codes by parity-check matrix extensions 利用奇偶校验矩阵扩展降低LDPC码的误差层
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205738
E. Sharon, Omer Fainzilber, S. Litsyn
{"title":"Decreasing error floor in LDPC codes by parity-check matrix extensions","authors":"E. Sharon, Omer Fainzilber, S. Litsyn","doi":"10.1109/ISIT.2009.5205738","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205738","url":null,"abstract":"High error floors in optimized irregular LDPC codes limit their usage in applications that require low error rates. We introduce new methods for lowering the error floor of LDPC codes, based on enhancing the code's parity-check matrix with additional linearly dependent and independent parity-checks. We prove NP hardness of certain optimization problems related to proposed methods and provide upper bound on the number of parity-checks that need to be added. We show that the proposed methods can lower the error floor of the code significantly, by several orders of magnitude, at negligible or no rate penalty.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133728886","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
Single-Gaussian messages and noise thresholds for decoding low-density lattice codes 解码低密度格码的单高斯信息和噪声阈值
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205680
B. Kurkoski, K. Yamaguchi, Kingo Kobayashi
{"title":"Single-Gaussian messages and noise thresholds for decoding low-density lattice codes","authors":"B. Kurkoski, K. Yamaguchi, Kingo Kobayashi","doi":"10.1109/ISIT.2009.5205680","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205680","url":null,"abstract":"A new method for decoding low-density lattice codes is given, wherein the belief-propagation decoder messages are single Gaussian functions. Since the message can be represented by two numbers, a mean and a variance, the complexity of this decoder is lower than previous decoders, which either quantized the mixture, or used a mixture of Gaussians. The computational complexity at the check node is also lower. The performance of various code designs, under single-Gaussian decoding, is evaluated by noise thresholds. In particular, the proposed decoding algorithm has noise threshold within 0.1 dB of the quantized-message decoder, which is considerably more complex.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115357277","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}
引用次数: 17
A new capacity upper bound for “Relay-With-Delay” channel “延迟中继”信道的新容量上限
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205971
A. Salimi, M. Mirmohseni, M. Aref
{"title":"A new capacity upper bound for “Relay-With-Delay” channel","authors":"A. Salimi, M. Mirmohseni, M. Aref","doi":"10.1109/ISIT.2009.5205971","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205971","url":null,"abstract":"In this paper we prove a new capacity upper bound for a class of relay channels known as Relay-With-Delay channels. The proposed bound is general and holds for any arbitrary amount of delay. We have shown that the previously introduced bounds can be considered as special cases of our proposed upper bound. The new introduced bound is, in some cases, tighter than the previously established bounds. It is also notable that the proposed bound coincides with the previously known capacity of “Relay-With-Delay” channels.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115117527","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}
引用次数: 5
Capacity-achieving codes for channels with memory with maximum-likelihood decoding 具有最大似然解码的存储器信道的容量实现码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205692
J. Bae, A. Anastasopoulos
{"title":"Capacity-achieving codes for channels with memory with maximum-likelihood decoding","authors":"J. Bae, A. Anastasopoulos","doi":"10.1109/ISIT.2009.5205692","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205692","url":null,"abstract":"Codes on sparse graphs have been shown to achieve remarkable performance in point-to-point channels with low decoding complexity. Most of the results in this area are based on experimental evidence and/or approximate analysis. The question of whether codes on sparse graphs can achieve the capacity of noisy channels with iterative decoding is still open, and has only been conclusively and positively answered for the binary erasure channel. On the other hand, codes on sparse graphs have been proven to achieve the capacity of memoryless, binary-input, output-symmetric channels with finite graphical complexity per information bit when maximum likelihood (ML) decoding is performed. In this paper, we consider transmission over finite-state channels (FSCs). We derive upper bounds on the average error probability of code ensembles with ML decoding. Based on these bounds we show that codes on sparse graphs can achieve the symmetric information rate (SIR) of FSCs, which is the maximum achievable rate with independently and uniformly distributed input sequences. In order to achieve rates beyond the SIR, we consider a simple quantization scheme that when applied to ensembles of codes on sparse graphs induces a Markov distribution on the transmitted sequence. By deriving average error probability bounds for these quantized code ensembles, we prove that they can achieve the information rates corresponding to the induced Markov distribution, and thus approach the FSC capacity.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116962519","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
Cooperation above the physical layer: The case of a simple network 物理层以上的协作:简单网络的情况
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205278
B. Rong, A. Ephremides
{"title":"Cooperation above the physical layer: The case of a simple network","authors":"B. Rong, A. Ephremides","doi":"10.1109/ISIT.2009.5205278","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205278","url":null,"abstract":"In this paper, we investigate the effects of “network-level” cooperation in a wireless three-node network with packet erasure links. Cooperation is achieved through the relaying of packets from the node farthest away from the destination by the intermediate node. We consider both scheduled access and random access, and compare the performance metrics of “stability region” and “throughput region”. We observe that the throughput region depends on the priority choices at the relay node, and may or may not be equal to the stability region, which is shown to be independent of the priority choices. By contrast, in the non-cooperative random access system, the stability region and the throughput region are proved to be identical. Furthermore, if we apply network coding at the relay node, there is no improvement either in the stability region or in the throughput region over plain store-and-forward routing.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116351223","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}
引用次数: 36
Interference management through cooperation 合作管理干扰
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205357
V. Prabhakaran, P. Viswanath
{"title":"Interference management through cooperation","authors":"V. Prabhakaran, P. Viswanath","doi":"10.1109/ISIT.2009.5205357","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205357","url":null,"abstract":"We consider a two-user interference channel where the source/destination nodes can cooperate with each other by virtue of being able to both transmit and receive. For the full-duplex mode of operation, we characterize the sum capacity of a linear deterministic channel exactly, and that of the Gaussian channel up to a constant number of bits. This reveals a reciprocity between the cases where the sources cooperate and the destinations cooperate. The main contributions are novel strategies and new upper bounds.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125816786","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
The entropy power of a sum is fractionally superadditive 和的熵幂是分数超加性的
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205442
M. Madiman, F. Ghassemi
{"title":"The entropy power of a sum is fractionally superadditive","authors":"M. Madiman, F. Ghassemi","doi":"10.1109/ISIT.2009.5205442","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205442","url":null,"abstract":"It is shown that the entropy power of a sum of independent random vectors, seen as a set function, is fractionally superadditive. This resolves a conjecture of the first author and A. R. Barron, and implies in particular all previously known entropy power inequalities for independent random variables. It is also shown that, for general dimension, the entropy power of a sum of independent random vectors is not supermodular.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129463020","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
Reducing the space complexity of a Bayes coding algorithm using an expanded context tree 利用扩展上下文树降低贝叶斯编码算法的空间复杂度
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205677
T. Matsushima, S. Hirasawa
{"title":"Reducing the space complexity of a Bayes coding algorithm using an expanded context tree","authors":"T. Matsushima, S. Hirasawa","doi":"10.1109/ISIT.2009.5205677","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205677","url":null,"abstract":"The context tree models are widely used in a lot of research fields. Patricia[7] like trees are applied to the context trees that are expanded according to the increase of the length of a source sequence in the previous researches of non-predictive source coding and model selection. The space complexity of the Patricia like context trees are O(t) where t is the length of a source sequence. On the other hand, the predictive Bayes source coding algorithm cannot use a Patricia like context tree, because it is difficult to hold and update the posterior probability parameters on a Patricia like tree. So the space complexity of the expanded trees in the predictive Bayes coding algorithm is O(t2). In this paper, we propose an efficient predictive Bayes coding algorithm using a new representation of the posterior probability parameters and the compact context tree holding the parameters whose space complexity is O(t).","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128737279","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}
引用次数: 17
首页 上一页 下一页 尾页
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学术官方微信