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

On the vector Gaussian L-terminal CEO problem 关于向量高斯l端CEO问题

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284256

Jia Wang, Jun Chen

引用次数: 15

On the uncertainty of information retrieval in associative memories 联想记忆中信息检索的不确定性研究

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283016

Eitan Yaakobi, Jehoshua Bruck

{"title":"On the uncertainty of information retrieval in associative memories","authors":"Eitan Yaakobi, Jehoshua Bruck","doi":"10.1109/ISIT.2012.6283016","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283016","url":null,"abstract":"We (people) are memory machines. Our decision processes, emotions and interactions with the world around us are based on and driven by associations to our memories. This natural association paradigm will become critical in future memory systems, namely, the key question will not be “How do I store more information?” but rather, “Do I have the relevant information? How do I retrieve it?” The focus of this paper is to make a first step in this direction. We define and solve a very basic problem in associative retrieval. Given a word W, the words in the memory that are t-associated with W are the words in the ball of radius t around W. In general, given a set of words, say W, X and Y, the words that are t-associated with {W, X, Y} are those in the memory that are within distance t from all the three words. Our main goal is to study the maximum size of the t-associated set as a function of the number of input words and the minimum distance of the words in memory - we call this value the uncertainty of an associative memory. We derive the uncertainty of the associative memory that consists of all the binary vectors with an arbitrary number of input words. In addition, we study the retrieval problem, namely, how do we get the t-associated set given the inputs? We note that this paradigm is a generalization of the sequences reconstruction problem that was proposed by Leven-shtein (2001). In this model, a word is transmitted over multiple channels. A decoder receives all the channel outputs and decodes the transmitted word. Levenshtein computed the minimum number of channels that guarantee a successful decoder - this value happens to be the uncertainty of an associative memory with two input words.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127196840","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}

引用次数: 47

Projected subcodes of the second order binary Reed-Muller code 二阶二进制里德-穆勒码的投影子码

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283977

Matthieu Legeay, P. Loidreau

引用次数: 0

Guiding blind transmitters: Relay-aided interference alignment for the X channel 引导盲发射机:X频道的中继辅助干扰校准

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283517

Ye Tian, A. Yener

引用次数: 9

Codes over non-Abelian groups: Point-to-point communications and computation over MAC 非阿贝尔群上的代码:MAC上的点对点通信和计算

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284269

A. G. Sahebi, S. Pradhan

引用次数: 3

New achievable rates for nonlinear Volterra channels via martingale inequalities 基于鞅不等式的非线性Volterra通道的新可实现速率

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283497

Kostis Xenoulis, N. Kalouptsidis, I. Sason

引用次数: 6

Linear-programming decoding of Tanner codes with local-optimality certificates 具有局部最优性证书的Tanner码的线性规划解码

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284007

N. Halabi, G. Even

引用次数: 3

Genie chains and the degrees of freedom of the K-user MIMO interference channel 精灵链和k用户MIMO干扰信道的自由度

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283961

Chenwei Wang, Hua Sun, S. Jafar

{"title":"Genie chains and the degrees of freedom of the K-user MIMO interference channel","authors":"Chenwei Wang, Hua Sun, S. Jafar","doi":"10.1109/ISIT.2012.6283961","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283961","url":null,"abstract":"We explore the degrees of freedom (DoF) of the K >; 3 user MT × MR MIMO Gaussian interference channel where each transmitter is equipped with MT and each receiver is equipped with MR antennas. Expressing the DoF characterization as a function of the ratio γ = M/N, where M = min(MT, MR) and N = max(MT, MR), we find that when γ ≤ γo = K-1/K(K-2) = γo, the DoF value per user is piecewise linear depending on M and N alternately, similar to the DoF characterization for K = 3 which has been previously obtained. The regime γ >; γo, which is the dominant regime for K >; 3 users and is not encountered in the K = 3 user setting, is the main focus of this paper. Our DoF results in this regime are obtained through a novel “genie chains” approach, which is the main contribution of this work. It is a chain of mappings from genie signals provided to a receiver to the exposed signal spaces at that receiver, which then serve as the genie signals for the next receiver in the chain, until an acceptable genie with the required number of dimensions is obtained, essentially converting an information theoretic problem into a linear algebra problem.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125258347","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}

引用次数: 32

Upper bound for the capacity of multiple access protocols on multipacket reception channels 多包接收信道上的多接入协议容量上限

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283545

D. Chan, T. Berger

引用次数: 5

An analytic upper bound on T-complexity t复杂度的解析上界

2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284014

U. Speidel, T. Gulliver

引用次数: 5