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

2014 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Achievability bounds for unequal message protection at finite block lengths 有限块长度下不等报文保护的可达性界限
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875288
Yanina Y. Shkel, V. Tan, S. Draper
{"title":"Achievability bounds for unequal message protection at finite block lengths","authors":"Yanina Y. Shkel, V. Tan, S. Draper","doi":"10.1109/ISIT.2014.6875288","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875288","url":null,"abstract":"We study achievability bounds for a class of unequal error protection codebooks with m > 1 different classes of codewords called unequal message protection (UMP) codes. We extend the dependence testing bound due to Polyanskiy-Poor-Verdú to be applicable to UMP codes and use this extension to obtain refined asymptotic expansions for the performance of such codes over discrete memoryless channels. In addition, we consider two questions related to the practical construction of UMP codes. First, we study a “header” construction that prefixes the message class into a header followed by data protection using a standard homogeneous (classical) code. We show that, in general, this construction is not optimal at finite block lengths. We further demonstrate that our main UMP achievability bound can be obtained using coset codes, which suggests a path to tractable implementation of UMP codes.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"241 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":"122447174","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
Achievable partition information rate over noisy multi-access Boolean channel 噪声多址布尔信道上可实现的分区信息率
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875024
Shuhang Wu, Shuangqing Wei, Yue Wang, R. Vaidyanathan, Jian Yuan
{"title":"Achievable partition information rate over noisy multi-access Boolean channel","authors":"Shuhang Wu, Shuangqing Wei, Yue Wang, R. Vaidyanathan, Jian Yuan","doi":"10.1109/ISIT.2014.6875024","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875024","url":null,"abstract":"In this paper, we formulate a novel problem to quantify the amount of information transferred to partition active users who transmit following a common codebook over noisy Boolean multi-access channels. The objective of transmission is to ultimately let each active user aware of its own group only, not others. To solve the problem, we propose a novel framework by considering the decoding as a process of removing hyperedges of a complete hypergraph. For a particular, but non-trivial, case with two active users, an achievable bound for the defined partition information rate is found by using strong typical set decoding, as well as a large deviation technique for an induced Markov chain.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"40 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":"122723676","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
Detecting and reconstructing an unknown convolutional code by counting collisions 通过碰撞计数检测和重构未知卷积码
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875378
Marion Bellard, J. Tillich
{"title":"Detecting and reconstructing an unknown convolutional code by counting collisions","authors":"Marion Bellard, J. Tillich","doi":"10.1109/ISIT.2014.6875378","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875378","url":null,"abstract":"We suggest in this paper a new method for detecting whether a given binary sequence is a noisy convolutional codeword obtained from an unknown convolutional code. It basically consists in forming blocks of the sequence which are big enough to contain the support of a codeword in the dual of the convolutional code and to count the number of blocks which are equal. This detection process is quite efficient and presents the advantage over all previously known methods to achieve this goal even in the case of an unknown modulation. Moreover, this method can also be used to reconstruct the unknown convolutional code when the modulation is known.","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":"114190432","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
New information-estimation results for poisson, binomial and negative binomial models 泊松、二项和负二项模型的新信息估计结果
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875225
Camilo G. Taborda, F. Pérez-Cruz, Dongning Guo
{"title":"New information-estimation results for poisson, binomial and negative binomial models","authors":"Camilo G. Taborda, F. Pérez-Cruz, Dongning Guo","doi":"10.1109/ISIT.2014.6875225","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875225","url":null,"abstract":"In recent years, a number of mathematical relationships have been established between information measures and estimation measures for various models, including Gaussian, Poisson and binomial models. In this paper, it is shown that the second derivative of the input-output mutual information with respect to the input scaling can be expressed as the expectation of a certain Bregman divergence pertaining to the conditional expectations of the input and the input power. This result is similar to that found for the Gaussian model where the Bregman divergence therein is the square distance. In addition, the Poisson, binomial and negative binomial models are shown to be similar in the small scaling regime in the sense that the derivative of the mutual information and the derivative of the relative entropy converge to the same value.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"56 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":"121907151","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
On the power efficiency for cognitive radio networks with multiple relays 多中继认知无线网络的功率效率研究
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875063
M. Ashour, M. Butt, Amr M. Mohamed
{"title":"On the power efficiency for cognitive radio networks with multiple relays","authors":"M. Ashour, M. Butt, Amr M. Mohamed","doi":"10.1109/ISIT.2014.6875063","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875063","url":null,"abstract":"In this paper, we study and analyze cooperative cognitive radio networks with multiple secondary users (SUs). Each SU is considered a prospective relay for the primary user (PU) besides having its own data demand. The proposed scheme leverages the spectral efficiency of the system via allowing two SUs to transmit simultaneously thanks to dirty-paper coding. We propose a power allocation policy that minimizes the average transmitted power at each SU. Moreover, we are concerned with enhancing the throughput of both primary and secondary links. Towards this objective, we investigate multiple opportunistic relay selection policies. We develop a mathematical framework for deriving stability conditions for the queues involved in the system using outage probabilities. Results reveal that we achieve better performance in terms of average power and throughput as compared to uniform power allocation schemes proposed earlier in literature. Extensive numerical simulations are conducted to validate our theoretical findings.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"10 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":"122221289","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
Poissonization and universal compression of envelope classes 包络类的泊松化和通用压缩
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875158
Jayadev Acharya, Ashkan Jafarpour, A. Orlitsky, A. Suresh
{"title":"Poissonization and universal compression of envelope classes","authors":"Jayadev Acharya, Ashkan Jafarpour, A. Orlitsky, A. Suresh","doi":"10.1109/ISIT.2014.6875158","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875158","url":null,"abstract":"Poisson sampling is a method for eliminating dependence among symbols in a random sequence. It helps improve algorithm design, strengthen bounds, and simplify proofs. We relate the redundancy of fixed-length and Poisson-sampled sequences, use this result to derive a simple formula for the redundancy of general envelope classes, and apply this formula to obtain simple and tight bounds on the redundancy of power-law and exponential envelope classes, in particular answering a question posed in [1] about power-law envelopes.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"66 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":"116619442","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
Uplink-downlink duality for integer-forcing 整数强制的上行-下行对偶性
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875293
Wenbo He, B. Nazer, S. Shamai
{"title":"Uplink-downlink duality for integer-forcing","authors":"Wenbo He, B. Nazer, S. Shamai","doi":"10.1109/ISIT.2014.6875293","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875293","url":null,"abstract":"Consider a MIMO uplink channel with channel matrix H and a MIMO downlink channel with channel matrix Hτ. It is well-known that any rate tuple that is achievable on the uplink is also achievable on the downlink under the same total power constraint, i.e., there is an uplink-downlink duality relationship. In this paper, we consider the integer-forcing strategy, in which users steer the channel towards an integer-valued effective channel matrix so that the receiver(s) can decode integer-linear combinations of the transmitted codewords. Recent efforts have demonstrated the benefits of this strategy for uplink, downlink, and interference alignment scenarios. Here, we establish that uplink-downlink duality holds for integer-forcing. Specifically, in the uplink, L transmitters communicate over channel matrix H to an L-antenna receiver with target integer matrix A. In the downlink, an L-antenna transmitter communicates over channel matrix Hτ to L single-antenna receivers with target integer matrix Aτ. We show that any computation rate tuple that is achievable in the uplink is achievable for the same total power in the downlink and vice versa.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"62 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":"117082839","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}
引用次数: 21
New sample complexity bounds for phylogenetic inference from multiple loci 基于多基因座系统发育推断的新样本复杂度界
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875191
Gautam Dasarathy, R. Nowak, S. Roch
{"title":"New sample complexity bounds for phylogenetic inference from multiple loci","authors":"Gautam Dasarathy, R. Nowak, S. Roch","doi":"10.1109/ISIT.2014.6875191","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875191","url":null,"abstract":"We consider the problem of estimating the evolutionary history of a set of species (phylogeny or species tree) from several genes. It has been known however that the evolutionary history of individual genes (gene trees) might be topologically distinct from each other and from the underlying species tree, possibly confounding phylogenetic analysis. A further complication in practice is that one has to estimate gene trees from molecular sequences of finite length. We provide the first full data-requirement analysis of a species tree reconstruction method that takes into account estimation errors at the gene level. Under that criterion, we also devise a novel algorithm that provably improves over all previous methods in a regime of interest.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"81 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":"128232822","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
Some new results on index coding when the number of data is less than the number of receivers 当数据数小于接收数时，索引编码的一些新结果
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874882
Jungho So, Sangwoon Kwak, Y. Sung
{"title":"Some new results on index coding when the number of data is less than the number of receivers","authors":"Jungho So, Sangwoon Kwak, Y. Sung","doi":"10.1109/ISIT.2014.6874882","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6874882","url":null,"abstract":"In this paper, index coding problems in which the number (m) of receivers is larger than that (n) of data are considered. Unlike the case that the two numbers are same (n = m), index coding problems with n ≤ m are more general and hard to handle. To circumvent this difficulty, problems with n <; m are approached via corresponding problems with n = m. It is shown that in certain cases, the symmetric capacity and code construction for index coding problems with n <; m can be obtained from the existing symmetric capacity result and codes for index coding problems with n = m. Such cases include cases with n <; m ≤ 5.","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":"128404073","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
An upper bound on the minimum distance of array low-density parity-check codes 阵列低密度奇偶校验码最小距离的上界
2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875416
E. Rosnes, M. Ambroze, M. Tomlinson
{"title":"An upper bound on the minimum distance of array low-density parity-check codes","authors":"E. Rosnes, M. Ambroze, M. Tomlinson","doi":"10.1109/ISIT.2014.6875416","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875416","url":null,"abstract":"In this work, we present an upper bound on the minimum distance of array low-density parity-check (LDPC) codes. An array LDPC code is a quasi-cyclic LDPC code specified by two integers q and m, where q is an odd prime and m ≤ q. In the literature, the minimum distance of these codes (denoted by d(q,m)) has been thoroughly studied for m ≤ 5. Both exact results, for small values of q and m, and general (i.e., independent of q) bounds have been established. For m ≤ 6, the best known minimum distance upper bound, derived by Mittelholzer (IEEE Int. Symp. Inf. Theory, Jun./Jul. 2002), is d(q, 6) ≤ 32. In this work, we derive an improved upper bound of d(q, 6) ≤ 20 by using the concept of a template support matrix of a codeword. The bound is tight with high probability in the sense that we have not been able to find codewords of strictly lower weight for several values of q using a minimum distance probabilistic algorithm. Finally, we provide new specific minimum distance results for m ≤ 6 and low-to-moderate values of q ≤ 79.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"94 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":"126895872","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}
引用次数: 0
首页 上一页 下一页 尾页
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学术官方微信