2011 IEEE International Symposium on Information Theory Proceedings最新文献_第7页

Zero-error communication via quantum channels and a quantum Lovász θ-function 零误差通信通过量子信道和量子Lovász θ-函数

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034211

R. Duan, S. Severini, A. Winter

引用次数: 35

Spectrum pricing games with arbitrary bandwidth availability probabilities 具有任意带宽可用概率的频谱定价博弈

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034065

G. Kasbekar, S. Sarkar

引用次数: 19

The dispersion of infinite constellations 无限星座的色散

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033771

A. Ingber, R. Zamir, M. Feder

{"title":"The dispersion of infinite constellations","authors":"A. Ingber, R. Zamir, M. Feder","doi":"10.1109/ISIT.2011.6033771","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033771","url":null,"abstract":"In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and their optimal density is considered. Poltyrev's “capacity” is the highest achievable normalized log density (NLD) with vanishing error probability. This capacity as well as error exponents for this setting are known. In this work we consider the optimal NLD for a fixed, nonzero error probability, as a function of the codeword length (dimension) n. We show that as n grows, the gap to capacity is inversely proportional (up to the first order) to the square-root of n where the proportion constant is given by the inverse Q-function of the allowed error probability, times the square root of 1 over 2. In an analogy to similar result in channel coding, the dispersion of infinite constellations is 1 over 2 nat2 per channel use. We show that this optimal convergence rate can be achieved using lattices, therefore the result holds for the maximal error probability as well. Connections to the error exponent of the power constrained Gaussian channel and to the volume-to-noise ratio as a figure of merit are discussed.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126635727","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

Necessary conditions for consistent set-based graphical model selection 基于一致集的图形模型选择的必要条件

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034133

Divyanshu Vats, José M. F. Moura

{"title":"Necessary conditions for consistent set-based graphical model selection","authors":"Divyanshu Vats, José M. F. Moura","doi":"10.1109/ISIT.2011.6034133","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034133","url":null,"abstract":"Graphical model selection, where the goal is to estimate the graph underlying a distribution, is known to be an NP-hard problem. An important issue is to study theoretical limits on the performance of graphical model selection algorithms. In particular, given parameters of the underlying distribution, we want to find a lower bound on the number of samples required for accurate graph estimation. When deriving these theoretical bounds, it is common to treat the learning problem as a communication problem where the observations correspond to noisy messages and the decoding problem infers the graph from the observations. Current analysis of graphical model selection algorithms is limited to studying graph estimators that output a unique graph. In this paper, we consider graph estimators that output a set of graphs, leading to set-based graphical model selection (SB-GMS). This has connections to list-decoding where a decoder outputs a list of possible codewords instead of a single codeword. Our main contribution is to derive necessary conditions for accurate SB-GMS for various classes of graphical models and show reduction in the number of samples required for consistent estimation. Further, we derive necessary conditions on the cardinality of the set-based estimates given graph parameters.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126636858","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

Effective capacity region and optimal power control for fading broadcast channels 衰落广播信道的有效容量区域和最优功率控制

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034123

Deli Qiao, M. C. Gursoy, Senem Velipasalar

引用次数: 3

Noisy analog network coding for the two-way relay channel 噪声模拟网络的双向中继信道编码

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033919

M. N. Khormuji, M. Skoglund

引用次数: 9

Capacity of a class of overlay cognitive MAC radios 一类覆盖认知MAC无线电的容量

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033997

G. Chung, S. Vishwanath

引用次数: 2

Optimum joint detection and estimation 最优联合检测与估计

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034125

G. Moustakides

引用次数: 23

Interference alignment aided by relays for the quasi-static X channel 准静态X通道用继电器辅助的干扰对准

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034048

Dong-Sup Jin, Jong-Seon No, Dong-joon Shin

引用次数: 13

Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes LDPC码的分数距离边界及非二进制和广义码的基本多面体的有效方法

2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033739

D. Burshtein, I. Goldenberg

引用次数: 0