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

2010 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Distributed signal cancelation inspired by Witsenhausen's counterexample 受威森豪森反例启发的分布式信号抵消
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513262
P. Grover, A. Sahai
{"title":"Distributed signal cancelation inspired by Witsenhausen's counterexample","authors":"P. Grover, A. Sahai","doi":"10.1109/ISIT.2010.5513262","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513262","url":null,"abstract":"We consider the problem of two-stage signal cancelation based on noisy observations. This problem turns out to be an extension of the Witsenhausen counterexample — a famous open problem in distributed control. Cost is imposed on the power expended by the first controller, and the residual signal after the actions of the two controllers. Along the lines of a recent approximate solution to the Witsenhausen counterexample, we provide an approximate solution to this distributed signal cancelation problem to within a constant factor. This approximation holds uniformly over all problem parameters and for all vector lengths.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"18 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116864995","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
Normalized sum-capacity of interference networks with partial information 部分信息干扰网络的归一化和容量
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513396
V. Aggarwal, A. Avestimehr, A. Sabharwal
{"title":"Normalized sum-capacity of interference networks with partial information","authors":"V. Aggarwal, A. Avestimehr, A. Sabharwal","doi":"10.1109/ISIT.2010.5513396","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513396","url":null,"abstract":"In distributed wireless networks, nodes often do not have access to complete network information (e.g. network topology, channel gains, etc.). As a result, they have to execute their transmission and reception strategies with partial information about the network, in a distributed fashion. Thus, the key question is how good are the distributed decisions in comparison to the optimal decisions based on full network knowledge. In this paper, we formalize the concept of partial-information sum-capacity by defining normalized sum-capacity, which is defined as the maximum achievable fraction of full-information sum-capacity with a given amount of partial information. We then examine four deterministic networks, multiple access, multiuser Z-channel chain, one-to-many and many-to-one interference channel, and characterize the normalized sum-capacity. For each network, two cases of partial network information are analyzed: (a) each transmitter only knows the channel gains to its receiver, and (b) transmitters knows the channel gains of all links which are no more than two hops away. Quite interestingly, we show that in all eight cases (4 networks × 2 forms of partial information), the normalized sum-capacity is achieved by scheduling subnetworks for which there exist a universally optimal distributed strategy with the available partial information. Furthermore, we show that while actual sum-capacity is not known in all cases, normalized sum-capacity can be in fact be exactly characterized.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128411488","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
On order relations between lower bounds on the MSE of unbiased estimators 无偏估计量MSE下界之间的阶关系
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513333
K. Todros, J. Tabrikian
{"title":"On order relations between lower bounds on the MSE of unbiased estimators","authors":"K. Todros, J. Tabrikian","doi":"10.1109/ISIT.2010.5513333","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513333","url":null,"abstract":"Recently, some general classes of non-Bayesian, Bayesian and Hybrid lower bounds on the mean square error (MSE) of estimators have been developed via projection of each entry of the vector of estimation error on some Hilbert subspaces of L2. In this paper, we utilize this framework for derivation of order relations between lower bounds on the MSE of unbiased estimators. We show that some existing and new order relations can be simply obtained by comparing the corresponding Hilbert subspaces on which each entry of the vector of estimation error is projected.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128362873","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
The lifting construction: A general solution for the fat strut problem 吊装施工:胖撑问题的一般解决方案
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513728
N. Sloane, V. Vaishampayan, S. Costa
{"title":"The lifting construction: A general solution for the fat strut problem","authors":"N. Sloane, V. Vaishampayan, S. Costa","doi":"10.1109/ISIT.2010.5513728","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513728","url":null,"abstract":"A cylinder anchored at two distinct points of the lattice ℤn is called a strut if its interior does not contain a lattice point. We address the problem of constructing struts of maximal radius in ℤn. Our main result is a general construction technique, which we call the lifting construction, which produces a sequence of struts that are optimal in the limit. We also tighten a previous result of ours—an achievable lower bound on the volume of a strut. The problem is motivated by a nonlinear analog communication problem. We demonstrate, through simulation, improvements in performance that are obtained using our construction.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129317084","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
Tight asymptotic bounds for the deletion channel with small deletion probabilities 具有小删除概率的删除信道的紧渐近界
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513746
A. Kalai, M. Mitzenmacher, M. Sudan
{"title":"Tight asymptotic bounds for the deletion channel with small deletion probabilities","authors":"A. Kalai, M. Mitzenmacher, M. Sudan","doi":"10.1109/ISIT.2010.5513746","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513746","url":null,"abstract":"In this paper, we consider the capacity C of the binary deletion channel for the limiting case where the deletion probability p goes to 0. It is known that for any p < 1/2, the capacity satisfies C ≥ 1−H(p), where H is the standard binary entropy. We show that this lower bound is essentially tight in the limit, by providing an upper bound C ≤ 1−(1−o(1))H(p), where the o(1) term is understood to be vanishing as p goes to 0. Our proof utilizes a natural counting argument that should prove helpful in analyzing related channels.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124684262","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}
引用次数: 59
Capacity bounds on multi-pair two-way communication with a base-station aided by a relay 用中继辅助的基站进行多对双向通信的容量界限
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513411
Sang Joon Kim, B. Smida, N. Devroye
{"title":"Capacity bounds on multi-pair two-way communication with a base-station aided by a relay","authors":"Sang Joon Kim, B. Smida, N. Devroye","doi":"10.1109/ISIT.2010.5513411","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513411","url":null,"abstract":"The multi-pair bi-directional relay network under consideration consists of one base-station, multiple (say m) terminal nodes and one relay, all of which are half-duplex, in which, contrary to prior work, each node has a direct link with every other node. Each of the m terminal nodes exchanges messages with the base-station in a bi-directional fashion, leading to 2m total messages to be communicated with the (possible) help of the relay. Our contributions are: 1) the introduction of three new temporal protocols which fully exploit the two-way nature of the data, over-heard side-information through network coding, random binning, and compress-and-forward terminal node cooperation, 2) derivations of achievable rate regions and 3) cut-set based outer bounds for the multi-pair network, and 4) a numerical evaluation of the derived regions in Gaussian noise which illustrate the performance of the proposed protocols.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124241349","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}
引用次数: 16
Linear beamforming for the spatially correlated MISO broadcast channel 空间相关MISO广播信道的线性波束形成
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513553
V. Raghavan, V. Veeravalli, S. Hanly
{"title":"Linear beamforming for the spatially correlated MISO broadcast channel","authors":"V. Raghavan, V. Veeravalli, S. Hanly","doi":"10.1109/ISIT.2010.5513553","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513553","url":null,"abstract":"A spatially correlated broadcast setting with M antennas at the base station and M users (each with a single antenna) is considered. We assume that the users have perfect channel information about their links and the base station has only statistical information about each user's link. The base station employs a linear beamforming strategy with one spatial eigen-mode allocated to each user. The goal of this work is to understand the structure of the beamforming vectors that maximize the ergodic sum-rate achieved by treating interference as noise. In the M = 2 case, we first fix the beamforming vectors and compute the ergodic sum-rate in closed-form as a function of the channel statistics. We then show that the optimal beamforming vectors are the dominant generalized eigenvectors of the covariance matrices of the two links. It is difficult to obtain intuition on the structure of the optimal beamforming vectors for M > 2 due to the complicated nature of the sum-rate expression. Nevertheless, in the case of asymptotic M, we show that the optimal beamforming vectors have to satisfy a set of fixed-point equations.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121153373","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
On unconditionally secure oblivious transfer from continuous channels 从连续信道无条件安全无关传输
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513725
M. Isaka
{"title":"On unconditionally secure oblivious transfer from continuous channels","authors":"M. Isaka","doi":"10.1109/ISIT.2010.5513725","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513725","url":null,"abstract":"In this paper, we consider an information theoretically secure cryptographic primitive known as oblivious transfer based on noisy channels. We present a protocol and two approaches to base the primitive on much wider class of signal sets and continuous channels than the existing results on the Gaussian channel. We also evaluate the associated information theoretic efficiency of the protocol for some cases of interest.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114637923","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
Cooperative reliability for streaming multiple access 流多址的协同可靠性
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513416
Yanina Y. Shkel, S. Draper
{"title":"Cooperative reliability for streaming multiple access","authors":"Yanina Y. Shkel, S. Draper","doi":"10.1109/ISIT.2010.5513416","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513416","url":null,"abstract":"In this paper we bound the reliability function of decoding with errors and erasures for a streaming multiple-access channel with feedback. We show that, subject to an arbitrarily small bound on the probability of erasure, the best known lower bound on the reliability function (i.e., achievable error exponent) for the single-user version of our problem can also be achieved in the multi-user setting for high sum-rates. In other words, at high rates the interference of another user need not decrease the achievable error exponent of either.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116269282","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
Secure-broadcast codes over linear-deterministic channels 线性确定性信道上的安全广播码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513521
A. Khisti, Danilo Silva, F. Kschischang
{"title":"Secure-broadcast codes over linear-deterministic channels","authors":"A. Khisti, Danilo Silva, F. Kschischang","doi":"10.1109/ISIT.2010.5513521","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513521","url":null,"abstract":"We study a non-multicast secure network coding problem with two receivers. First we study a linear-deterministic channel model with two receivers and a collection of eavesdroppers, which generalizes the Ozarow-Wyner wiretap channel II. The secrecy capacity region for independent and common messages is characterized and is achieved by concatenating a coset-coding scheme based on maximum rank distance codes with a repetition code. By applying our coding scheme at the source node of a network that uses an underlying generic network code we also establish the secrecy capacity region of a network coding problem with two sinks and one sender node.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116317839","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学术官方微信