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

2009 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Fast computation of Gröbner bases of ideals of F[x, y] F[x, y]的Gröbner理想基的快速计算
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205791
Yindong Chen, Yao Lu, Peizhong Lu
{"title":"Fast computation of Gröbner bases of ideals of F[x, y]","authors":"Yindong Chen, Yao Lu, Peizhong Lu","doi":"10.1109/ISIT.2009.5205791","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205791","url":null,"abstract":"This paper provides a fast algorithm for Gröbner bases of ideals of F[x, y] over a field F. We show that only the S-polynomials of neighbor pairs of a strictly ordered finite generating set are needed in the computing of a Gröbner bases of the ideal. It reduces dramatically the number of unnecessary S-polynomials that are processed. Although the complexity of the algorithm is hard to evaluated, it obviously has a great improvement from Buchberger's Algorithm.","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":"115856146","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
The Gray-Wyner network with a limited-rate helper to the encoder and decoders Gray-Wyner网络具有有限速率的编码器和解码器助手
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205985
Lei Zhao, H. Permuter
{"title":"The Gray-Wyner network with a limited-rate helper to the encoder and decoders","authors":"Lei Zhao, H. Permuter","doi":"10.1109/ISIT.2009.5205985","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205985","url":null,"abstract":"In this paper, the Gray-Wyner network with a limited-rate helper is investigated. The helper sends a common message to the encoder and the decoders. We characterize the complete rate region. Successive refinement with a limited-rate helper is treated as a special case. The rate region for a Gaussian source with squared error distortions is explicitly calculated.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"141 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":"116051503","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
A polynomial-time construction of self-orthogonal codes and applications to quantum error correction 自正交码的多项式时间构造及其在量子纠错中的应用
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205647
M. Hamada
{"title":"A polynomial-time construction of self-orthogonal codes and applications to quantum error correction","authors":"M. Hamada","doi":"10.1109/ISIT.2009.5205647","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205647","url":null,"abstract":"A polynomial-time construction of a sequence of self-orthogonal geometric Goppa codes attaining the Tsfasman-Vlăduţ-Zink (TVZ) bound is presented. The issue of constructing such a code sequence was addressed in a context of constructing quantum error-correcting codes (Ashikhmin et al., 2001). Naturally, the obtained construction has implications on quantum error-correcting codes. In particular, the best known asymptotic lower bounds on the largest minimum distance of polynomially constructible quantum error-correcting codes are improved.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"23 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":"123571922","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
Separate network coding for private and common messages from one source to two sinks 为从一个源到两个接收点的私有和公共消息分离网络编码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205748
Kunihiko Harada, Hirosuke Yamamoto
{"title":"Separate network coding for private and common messages from one source to two sinks","authors":"Kunihiko Harada, Hirosuke Yamamoto","doi":"10.1109/ISIT.2009.5205748","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205748","url":null,"abstract":"Ngai-Yeung and Erez-Feder independently derived the capacity region of network coding with a single source and two sinks, in which a common message is sent from the source to both sinks but each private message is sent to only the corresponding sink. In this paper, it is shown that the above capacity region can be achieved by separate linear coding such that three routes of private and common messages are perfectly separated. This means that each private message can be sent to the corresponding sink only by routing while the common message can be sent to both sinks by a relatively simple multicast linear network code.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"97 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":"124676874","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
A differential equation method to derive the formulas of the T-complexity and the LZ-complexity 用微分方程法推导出t复杂度和lz复杂度的公式
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205702
K. Hamano, Hirosuke Yamamoto
{"title":"A differential equation method to derive the formulas of the T-complexity and the LZ-complexity","authors":"K. Hamano, Hirosuke Yamamoto","doi":"10.1109/ISIT.2009.5205702","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205702","url":null,"abstract":"It is shown that the T-complexity can be derived from a differential equation which represents how average codeword length increases by the T-augmentation. Furthermore, the proposed differential equation method can be applied to the LZ-complexity in the same way. This new approach is simple, and the obtained expressions coincide with the ones in previous studies.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"42 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":"124718468","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
Application of joint source-relay scheduling to cooperative multiple access channels 联合源中继调度在协同多址信道中的应用
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206073
Z. Ding, D. Goeckel, K. Leung, D. Towsley
{"title":"Application of joint source-relay scheduling to cooperative multiple access channels","authors":"Z. Ding, D. Goeckel, K. Leung, D. Towsley","doi":"10.1109/ISIT.2009.5206073","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206073","url":null,"abstract":"In this paper, we propose a novel spectrally efficient cooperative transmission protocol for multiple access scenarios. Different to some existing cooperative multiple access schemes, the proposed scheme can exploit the availability of relays as an extra dimension to increase reception robustness. By carefully scheduling the multiple sources and relays' transmission, a source with a poor connection to the destination can have higher priority to obtain better help from relays. As a result, the full diversity gain can be achievable for each user although only a fraction of the all relays is scheduled to help him. An achievable diversity-multiplexing tradeoff (DMT) is developed for the proposed transmission protocol to assist performance evaluation. With a large number of relays, the DMT achieved by the proposed scheme can approximate the optimal multiple-input single-input upper bound. Both analytical and numerical results show that the proposed protocol can outperform comparative schemes in most conditions.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"36 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":"122961157","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
Optimal quantization of random measurements in compressed sensing 压缩感知中随机测量的最优量化
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205695
John Z. Sun, Vivek K Goyal
{"title":"Optimal quantization of random measurements in compressed sensing","authors":"John Z. Sun, Vivek K Goyal","doi":"10.1109/ISIT.2009.5205695","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205695","url":null,"abstract":"Quantization is an important but often ignored consideration in discussions about compressed sensing. This paper studies the design of quantizers for random measurements of sparse signals that are optimal with respect to mean-squared error of the lasso reconstruction. We utilize recent results in high-resolution functional scalar quantization and homotopy continuation to approximate the optimal quantizer. Experimental results compare this quantizer to other practical designs and show a noticeable improvement in the operational distortion-rate performance.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"315 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":"122987127","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}
引用次数: 94
Negacyclic MDS codes over GR(2a,m) GR(2a,m)上的负循环MDS码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205253
Shixin Zhu, X. Kai, Ping Li
{"title":"Negacyclic MDS codes over GR(2a,m)","authors":"Shixin Zhu, X. Kai, Ping Li","doi":"10.1109/ISIT.2009.5205253","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205253","url":null,"abstract":"Using Reed-Solomon codes and cyclic MDS codes of length 2<sup>m</sup> + 1 over F<inf>2m</inf>, we obtain several classes of negacyclic MDS codes over GR(2<sup>a</sup>,m) of lengths 2<sup>m</sup> − 1 and 2<sup>m</sup> + 1 as analogues of Hensel lifts of these codes.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"691 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":"123296115","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 and error exponent analysis of multilevel coding with multistage decoding 多级译码的多级编码容量和误差指数分析
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205311
A. Ingber, M. Feder
{"title":"Capacity and error exponent analysis of multilevel coding with multistage decoding","authors":"A. Ingber, M. Feder","doi":"10.1109/ISIT.2009.5205311","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205311","url":null,"abstract":"The capacity and random coding error exponent of multilevel coding (MLC) with multistage decoding (MSD) are analyzed. General discrete memoryless channels with arbitrary input distributions are considered. The capacities of MLC with maximum likelihood decoding and with MSD are calculated, and it is shown that using MLC may result in loss in the achievable rate for reliable communication. Necessary and sufficient conditions for the rate loss to be zero are derived. A new random coding error exponent is derived for MLC with MSD. For the special case of uniform inputs, the new error exponent can be easily calculated by its inverse function, which is given by the sum of the inverse error exponents of the conditional sub-channels.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"6 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":"122155382","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
Analysis of multiple-unicast throughput in finite-buffer Delay-Tolerant Networks 有限缓冲容延迟网络中多播吞吐量分析
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205792
R. Subramanian, F. Fekri
{"title":"Analysis of multiple-unicast throughput in finite-buffer Delay-Tolerant Networks","authors":"R. Subramanian, F. Fekri","doi":"10.1109/ISIT.2009.5205792","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205792","url":null,"abstract":"The problem of computing the throughput capacity of general unicast in a Delay-Tolerant Network under the finite-buffer regime is addressed in this paper. A sparse mobile wireless network deployed on an M × M square-grid is considered, wherein m unique mobile source/destination pairs communicate with the aid of n mobile relay nodes using the store, carry, and forward paradigm. Each mobile relay node is equipped with a finite storage. Thus, several source/destination pairs contend for limited network resources. Under this setup, the throughput achieved per source-destination pair at steady-state node-mobility is analyzed, incorporating practical considerations such as node-to-node contention and finite communication range, for a class of two-hop relay protocols. In addition, two different approaches for buffer management are considered. The paper shows that, using a novel approach based on embedded Markov-chains, accurate analysis of the throughput can be achieved for the above model, as it is validated by simulations. A significant conclusion of this work is that considerable throughput improvements can be achieved by judicially managing the relay-node buffer-space.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"37 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":"121543359","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
首页 上一页 下一页 尾页
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学术官方微信