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

2009 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Distortion-rate tradeoff of a source uniformly distributed over the Composite PF(N) and the composite stiefel manifolds 均匀分布在复合PF(N)和复合stiefel流形上的源的失真率权衡
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205724
R. T. Krishnamachari, M. Varanasi
{"title":"Distortion-rate tradeoff of a source uniformly distributed over the Composite PF(N) and the composite stiefel manifolds","authors":"R. T. Krishnamachari, M. Varanasi","doi":"10.1109/ISIT.2009.5205724","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205724","url":null,"abstract":"To model the benefit accrued due to limited rate feedback on the information transfer of optimal ‘input covariance matrices’ from a channel-aware receiver to the transmitting users in a multiple-access channel, we study the distortion-rate tradeoff of a source uniformly distributed over multivariate generalizations of P<inf>F</inf>(n,p<sup>2</sup>) (the set of positive semi-definite matrices with a trace constraint) and V<inf>n,k</inf><sup>ℂ</sup> (the classical Stiefel surface) manifolds. Using sphere-packing and random coding arguments, the distortion-rate function is bounded within asymptotically tight limits.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"48 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":"127225221","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
Reducing repair traffic for erasure coding-based storage via interference alignment 通过干扰对齐减少基于擦除编码的存储的修复流量
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205898
Yunnan Wu, A. Dimakis
{"title":"Reducing repair traffic for erasure coding-based storage via interference alignment","authors":"Yunnan Wu, A. Dimakis","doi":"10.1109/ISIT.2009.5205898","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205898","url":null,"abstract":"We consider the problem of recovering from a single node failure in a storage system based on an (n, k) MDS code. In such a scenario, a straightforward solution is to perform a complete decoding, even though the data to be recovered only amount to 1/kth of the entire data. This paper presents techniques that can reduce the network traffic incurred. The techniques perform algebraic alignment so that the effective dimension of unwanted information is reduced.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"1 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":"127269908","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}
引用次数: 191
A distributed differential space-time coding scheme for two-way wireless relay networks 双向无线中继网络的分布式差分空时编码方案
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205644
Z. Utkovski, Gilbert Yammine, J. Lindner
{"title":"A distributed differential space-time coding scheme for two-way wireless relay networks","authors":"Z. Utkovski, Gilbert Yammine, J. Lindner","doi":"10.1109/ISIT.2009.5205644","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205644","url":null,"abstract":"We propose a distributed differential space-time coding scheme for two-way relaying over unknown block Rayleigh fading channels. The accent is on a two-time slots scheme, where in the first stage both terminals transmit their signals to the relays and in the second stage the relays broadcast to the terminals. Although we do not assume channel knowledge neither at the relays nor at the terminals, we show that it is possible for the terminals to subtract their contribution from the broadcasted signal and decide on the desired signal from the other terminal. The performance analysis reveals that the two-time slots differential scheme offers advantage over the traditional four-time slots differential scheme.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"14 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":"125654558","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}
引用次数: 25
Secret-key sharing based on layered broadcast coding over fading channels 基于衰落信道分层广播编码的密钥共享
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205823
Xiaojun Tang, Ruoheng Liu, P. Spasojevic
{"title":"Secret-key sharing based on layered broadcast coding over fading channels","authors":"Xiaojun Tang, Ruoheng Liu, P. Spasojevic","doi":"10.1109/ISIT.2009.5205823","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205823","url":null,"abstract":"A secret-key sharing strategy based on layered broadcast coding is introduced for slow fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from a passive eavesdropper, Eve. Both Alice-Bob and Alice-Eve channels are assumed to undergo slow fading, and perfect channel state information (CSI) is assumed to be known only at the receivers during the transmission. Layered coding facilitates adapting the reliably decoded rate at Bob to the actual channel state without CSI available at Alice. The index of a reliably decoded layer is sent back to Alice via a public and error-free channel, which is exploited by Alice and Bob to generate the secret key. In this paper, the secrecy key rate is derived. In addition, the optimal power distribution over coded layers is characterized. It is shown that layered coding can increase the secrecy key rate significantly compared with single-level coding.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"1 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":"129253497","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
Self-dual codes using the building-up construction 采用组合结构的自对偶编码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5206010
Jon-Lark Kim, Yoonjin Lee
{"title":"Self-dual codes using the building-up construction","authors":"Jon-Lark Kim, Yoonjin Lee","doi":"10.1109/ISIT.2009.5206010","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5206010","url":null,"abstract":"The building-up construction for self-dual codes was developed by the authors over finite fields GF(q) when q is a power of 2 or q ≡ 1 (mod 4). In this paper, we complete the building-up construction for self-dual codes over GF(q) with q ≡ 3 (mod 4). For example, we construct new 945 extremal self-dual ternary [32, 16, 9] codes, each of which has a trivial automorphism group.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"86 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":"125335154","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 simultaneous relay channel with informed receivers 在与通知接收器的同步中继信道上
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205996
A. Behboodi, P. Piantanida
{"title":"On the simultaneous relay channel with informed receivers","authors":"A. Behboodi, P. Piantanida","doi":"10.1109/ISIT.2009.5205996","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205996","url":null,"abstract":"The simultaneous relay channel is investigated where the source is unaware of the channel statistic controlling the communication but knows that this statistic is one of two possible discrete memoryless relay channels. We aim to derive coding schemes capable of transmitting information, regardless of which of these relays is present. First, this problem is recognized as being equivalent to that of sending common and private information to two destinations in presence of two helper relays. In this scenario, each possible relay links becomes a branch of the so-called broadcast relay channel. An inner bound on the capacity region of this channel is derived. Applications of these results arise when the source node is uncertain of the noise levels or the network topology (e.g. due to user mobility the positions of the relay and the destination nodes are unknown). Specific rates are computed for an AWGN relay channel, where the relay node may be absent but the source node is unaware of this.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"48 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":"125404574","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
Linear receiver based high-rate space-time block codes 基于线性接收机的高速空时分组码
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205589
Wei Zhang, Jinhong Yuan
{"title":"Linear receiver based high-rate space-time block codes","authors":"Wei Zhang, Jinhong Yuan","doi":"10.1109/ISIT.2009.5205589","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205589","url":null,"abstract":"Recently several STBC designs were proposed for MIMO systems with linear receivers. In this paper, we propose a new design of high-rate STBC with linear receivers. Compared to the overlapped Alamouti code (OAC) recently proposed by Shang and Xia, the new STBC has a higher symbol rate without guarantee of achieving full diversity. To achieve the same rate, the new STBC has only a half of the block length (code delay) of the OAC. Simulation results show that in comparison with some existing codes for a given rate the proposed STBC can give a better outage probability performance.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"8 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":"125534689","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
Two-way source coding with a common helper 双向源代码与一个共同的帮助
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205869
T. Weissman, Y. Steinberg, H. Permuter
{"title":"Two-way source coding with a common helper","authors":"T. Weissman, Y. Steinberg, H. Permuter","doi":"10.1109/ISIT.2009.5205869","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205869","url":null,"abstract":"Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions where a Markov form (Helper)-(User 1)-(User 2) holds. The main insight of the result is that in order to achieve the optimal rate, the helper may use a binning scheme, as in Wyner-Ziv, where the side information at the decoder is the “further” user, namely, User 2. The converse proofs use a new technique for verifying Markov relations via undirected graphs.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"26 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":"121591302","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
Noisy feedback schemes and rate-error tradeoffs from stochastic approximation 噪声反馈方案和随机逼近的误差率权衡
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205960
U. Kumar, J. N. Laneman, V. Gupta
{"title":"Noisy feedback schemes and rate-error tradeoffs from stochastic approximation","authors":"U. Kumar, J. N. Laneman, V. Gupta","doi":"10.1109/ISIT.2009.5205960","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205960","url":null,"abstract":"It is known that noiseless feedback does not increase the capacity of memoryless channels. However, such feedback can considerably increase the reliability or reduce the coding complexity of schemes that approach capacity. One might hope for the same to be (at least partially) true of noisy feedback. This paper develops a new class of coding schemes for additive white noise channels with feedback corrupted by additive white noise, focusing much of the results and discussion on the Gaussian case. These schemes are variants of the well-known Schalkwijk-Kailath (SK) coding scheme and are based upon simple techniques from stochastic approximation. Specifically, instead of the classic Robbins-Munro approach to stochastic approximation originally used in the SK scheme, we employ more recent techniques from Kushner. The resulting schemes enable a tradeoff between transmission rate and error performance in the presence of noisy feedback even as the number of iterations becomes large.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"66 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":"126365156","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
Efficient oblivious transfer from algebraic signaling over the Gaussian channel 高斯信道上代数信号的高效遗忘传输
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205944
M. Isaka
{"title":"Efficient oblivious transfer from algebraic signaling over the Gaussian channel","authors":"M. Isaka","doi":"10.1109/ISIT.2009.5205944","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205944","url":null,"abstract":"We study the use of the additive white Gaussian noise channel to achieve oblivious transfer which is an important cryptographic primitive in multiparty computation. An efficient protocol for unconditionally secure oblivious transfer is presented. We show that channel input alphabets with a certain algebraic structure and their partitions are useful in achieving privacy for players and ensuring high efficiency of the protocol. Security and information theoretic efficiency of the protocol is investigated.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"137 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120912396","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
首页 上一页 下一页 尾页
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学术官方微信