2011 IEEE International Symposium on Information Theory Proceedings最新文献

Fixed-length lossy compression in the finite blocklength regime: Discrete memoryless sources 有限块长度下的定长有损压缩:离散无内存源

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

V. Kostina, S. Verdú

引用次数: 18

On the asymptotic error probability of composite relay channels 复合中继信道的渐近误差概率

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

A. Behboodi, P. Piantanida

{"title":"On the asymptotic error probability of composite relay channels","authors":"A. Behboodi, P. Piantanida","doi":"10.1109/ISIT.2011.6033798","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033798","url":null,"abstract":"Consider the composite relay channel consisting of a set of relay channels associated to a probability measure. The current channel is a draw from its probability and in some cases arbitrary small error probability cannot be guaranteed for all channels in the set. In this paper, instead of finding the maximum achievable rate subject to a small error probability (EP) for all the channels in the set, we look at the asymptotic behavior of EP for a given rate. The notion of achievable EP is introduced as a novel performance measure for wireless relay channels. We can intuitively define it as the smallest EP that can be asymptotically achieved for a given rate. The behavior of EP is directly related to the ∈-capacity of each channel in the set. It is shown that the behavior of EP is upper and lower bounded by the outage probability of a region which is referred to as the full error region. Then every code with a rate belonging to this region yields EP equal to one. Finally, new coding for oblivious cooperation simultaneously exploiting both Decode-and-Forward (DF) and Compress-and-Forward (CF) strategies is investigated. The Gaussian relay channel with slow fading is also discussed.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"44 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":"116882318","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

Practical code design for compute-and-forward 实用代码设计的计算机和转发

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

Or Ordentlich, Jiening Zhan, U. Erez, M. Gastpar, B. Nazer

引用次数: 37

Secret sharing via noisy broadcast channels 通过嘈杂的广播频道进行秘密共享

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

L. Lai, Yingbin Liang, Wenliang Du, S. Shamai

{"title":"Secret sharing via noisy broadcast channels","authors":"L. Lai, Yingbin Liang, Wenliang Du, S. Shamai","doi":"10.1109/ISIT.2011.6033894","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033894","url":null,"abstract":"We consider the secret sharing problem, in which a dealer distributes a secret among a set of participants in such a manner that only qualified sets of users can recover the secret by pooling their shares together while non-qualified sets of users will obtain no information about the secret even if they pool their shares together. In contrast to the existing solutions that are mainly based on number theoretic tools, we propose a physical layer approach that exploits the presence of random noise inherent to wireless channels for secret sharing. Two different scenarios are considered. In the first scenario, the classic secret sharing problem with a single secret message is considered, in which qualified sets are specified by a general access structure. A secret sharing scheme is proposed by constructing a secure coding scheme for an equivalent compound wiretap channel. Based on this approach, both lower and upper bounds on the secret sharing capacity are obtained. For some special cases, the secret sharing capacity is fully characterized. In the second scenario, a generalization of the classic secret sharing problem is proposed, in which multiple secret messages are required to be recovered at different qualified sets. A secret sharing scheme is provided by constructing an equivalent broadcast channel with compound eavesdroppers and constructing a secure coding scheme for the equivalent channel.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"27 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":"127306239","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

Channels with intermittent errors 具有间歇性错误的信道

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

A. Mazumdar, A. Barg

引用次数: 4

Max-flow min-cut theorem for Rényi entropy in communication networks 通信网络中r<s:1>熵的最大流最小割定理

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

M. Gadouleau, Søren Riis

{"title":"Max-flow min-cut theorem for Rényi entropy in communication networks","authors":"M. Gadouleau, Søren Riis","doi":"10.1109/ISIT.2011.6034200","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034200","url":null,"abstract":"A symbolic approach to communication networks, where the topology of the underlying network is contained in a set of formal terms, was recently introduced. Many communication problems can be recast as dispersion problems in this setup. The so-called min-cut of a term set represents its number of degrees of freedom. For any assignment of function symbols, its dispersion measures the amount of information sent to the destinations. It was proved that the maximum dispersion asymptotically reaches the min-cut of the term set. In this paper, we refine this result in two ways. First, we prove a max-flow min-cut theorem for the Rényi entropy with order less than one, given that the inputs are equiprobably distributed; conversely, there is no max-flow min-cut theorem for Rényi entropy with order greater than one. Second, although linear coding functions have the practical appeal of low complexity, we prove that they are insufficient in general to reach the min-cut. More specifically, there exist term sets which have an arbitrarily large dispersion for non-linear coding functions, yet limited dispersion when linear coding functions are considered. Conversely, we show that if there is a solution based on low degree polynomials, then there exists a linear solution.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"3 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":"125064182","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

On completing the degrees of freedom characterization of MIMO interference networks with No CSIT 完成无CSIT的MIMO干扰网络的自由度表征

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

C. Vaze, M. Varanasi

{"title":"On completing the degrees of freedom characterization of MIMO interference networks with No CSIT","authors":"C. Vaze, M. Varanasi","doi":"10.1109/ISIT.2011.6034164","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034164","url":null,"abstract":"The two-user multi-input, multi-output (MIMO) interference and cognitive radio channels are studied under the assumption of no channel state information at the transmitter (CSIT) from the degrees of freedom (DoF) region perspective. With M<inf>i</inf> and N<inf>i</inf> denoting the number of antennas at transmitter i and receiver i respectively, the DoF region of the MIMO interference channel was recently characterized by Huang et al., Zhu and Guo, and by the authors of this paper for all values of the 4-tuple (M<inf>1</inf>,M<inf>2</inf>,N<inf>1</inf>,N<inf>2</inf>), except when min(M<inf>1</inf>,N<inf>1</inf>) > N<inf>2</inf> > M<inf>2</inf> (or min(M<inf>2</inf>,N<inf>2</inf>) > N<inf>1</inf> > M<inf>1</inf>). This latter case was solved more recently by Zhu and Guo, who provided a tight outer-bound. Here, a simpler and more widely applicable proof of that outer-bound is given based on the idea of interference localization. Using it, the DoF region is also established for the class of MIMO cognitive radio channels (under certain restrictions on the fading distributions) when min(M<inf>1</inf> + M<inf>2</inf>,N<inf>1</inf>) > N<inf>2</inf> > M<inf>2</inf> (with the second transmitter cognitive) - the only class for which the inner and outer bounds previously obtained by the authors were not tight.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"1 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":"125948062","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

Error exponents in asynchronous communication 异步通信中的错误指数

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

Da Wang, V. Chandar, Sae-Young Chung, G. Wornell

引用次数: 19

The diversity of MMSE receiver over frequency-selective MIMO channel MMSE接收机在选频MIMO信道上的分集

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

A. Mehana, Aria Nosratinia

引用次数: 10

Weighted sum rate maximization for the MIMO X channel through MMSE precoding 通过MMSE预编码实现MIMO X信道加权和速率最大化

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

A. Agustin, J. Vidal

引用次数: 6