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

A lattice of gambles 赌博的格子

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

P. Cuff, T. Cover, G. Kumar, Lei Zhao

{"title":"A lattice of gambles","authors":"P. Cuff, T. Cover, G. Kumar, Lei Zhao","doi":"10.1109/ISIT.2011.6033851","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033851","url":null,"abstract":"A gambler walks into a hypothetical fair casino with a very real dollar bill, but by the time he leaves he's exchanged that for a random amount of money. What is lost in the process? It may be that the gambler walks out at the end of the day, after a roller-coaster ride of winning and losing, with his dollar still intact—or maybe even with two dollars. But what the gambler loses the moment he places his first bet is position. He exchanges one distribution of money for a distribution of lesser value, and he can't get back to the original distribution. Our first discussion in this work connects known results of economic inequality and majorization to the probability theory of gambling and Martingales. We provide a simple proof that fair gambles cannot increase the Lorenz curve, and we also constructively demonstrate that any sequence of non-increasing Lorenz curves corresponds to at least one Martingale. We next consider the efficiency of gambles. If any fair gamble is available then one can move down the lattice of distributions with respect to the Lorenz ordering. The step from one distribution to the next is not unique. Is there a sense of efficiency with which one can move down the Lorenz stream? One approach would be to minimize the average total volume of money placed on the table. In this case, it turns out that implementing part of the strategy using private randomness can help reduce the need for the casino's randomness, resulting in less money on the table that the casino can get its hands on.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"10 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":"128749992","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

Rate-distortion functions for source coding with complementary side information 具有互补边信息的码源编码的率失真函数

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

R. Timo, A. Grant, G. Kramer

引用次数: 14

Scalar quantization with Rényi entropy constraint 基于rsamnyi熵约束的标量量化

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

W. Kreitmeier, T. Linder

引用次数: 0

The information theoretic characterization of the capacity of channels with noisy feedback 带噪声反馈信道容量的信息论表征

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

Chong Li, N. Elia

引用次数: 13

On the generalized degrees of freedom region of the MIMO interference channel with no CSIT 无CSIT的MIMO干扰信道的广义自由度区域

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

C. Vaze, Sanjay Karmakar, M. Varanasi

{"title":"On the generalized degrees of freedom region of the MIMO interference channel with no CSIT","authors":"C. Vaze, Sanjay Karmakar, M. Varanasi","doi":"10.1109/ISIT.2011.6034236","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034236","url":null,"abstract":"The generalized degrees of freedom region (GDoF) of the multiple-input multiple-output (MIMO) interference channel (IC) is studied under the “no CSIT” assumption under which there is perfect channel state information (CSI) at the receivers and no CSI at the transmitters (CSIT). In the very weak interference regime, where the ratio of channel gains (in dB) of the interfering and direct links, α, is ≤ 0.5, the GDoF regions are characterized for the two classes of the MIMO ICs defined by (a) M<inf>1</inf> = N<inf>1</inf> > M<inf>2</inf> ≥ N<inf>2</inf> and (b) M<inf>1</inf> = N<inf>1</inf> > N<inf>2</inf> > M<inf>2</inf> (where M<inf>i</inf> is the number of antennas at transmitter i and N<inf>i</inf> is the number of antennas at receiver i, i ∈ {1, 2}). In particular, inner-bounds are obtained by developing CSI-independent coding schemes using which it is shown that for each of the two classes a significant portion of the perfect-CSIT GDoF region can be achieved even without CSIT. Furthermore, tight outer-bounds to the no-CSIT GDoF regions are obtained that simultaneously account for the interference encountered by both the receivers. These bounds are thus fundamentally different from those derived in earlier works which deal with the case of α = 1, i.e., the degrees of freedom (DoF) regions. Interestingly, it is found that the loss of DoFs due to lack of CSIT is much less pronounced for the α ≤ 1 over 2 than it is for α = 1.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"29 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":"129260021","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}

引用次数: 21

The entropy gain of quantum channels 量子通道的熵增益

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

A. Holevo

引用次数: 7

Cliff effect suppression through multiple-descriptions with split personality 人格分裂多重描述对悬崖效应的抑制

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

S. Kokalj-Filipovic, E. Soljanin, Yang Gao

{"title":"Cliff effect suppression through multiple-descriptions with split personality","authors":"S. Kokalj-Filipovic, E. Soljanin, Yang Gao","doi":"10.1109/ISIT.2011.6034278","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034278","url":null,"abstract":"We propose a compression/transmission scheme that allows the quality of the reconstructed signal to gracefully degrade as the channel quality drops, as well as steadily improve with the channel improvement. The main idea is to partition the channel and/or network resources into m units (e.g., sub-bands, packets) and compress the source independently m times to perfectly match single unit resources, thus creating m independently distorted source versions. Consequently, we create a multiple-description, joint source-channel like architecture, that enables efficient reconstruction starting from a single received description with improvements onward. We further split the compression rate in two parts, allocating one to a rate-distortion optimal encoder, and the other to transmitting uncoded source symbols. We show how this architecture can easily leverage modularity in terms of adjustable rate-splitting ratio and the maximum number of descriptions, e.g., through software parameters, to simultaneously and robustly (i.e. avoiding the cliff effect) achieve operating points close to rate-distortion curve for many channel states. We demonstrate how statistical description of channel states (or performance statistics of content delivery network) can be used to set the two parameters constructively in terms of converging to optimal operation in the range of interest.","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":"129339093","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}

引用次数: 17

Prediction of priors for communication over arbitrarily varying channels 在任意变化的信道上进行通信的先验预测

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

Y. Lomnitz, M. Feder

引用次数: 3

Combinatorial lower bound for list decoding of codes on finite-field Grassmannian 有限域格拉斯曼序列译码的组合下界

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

R. Agarwal

引用次数: 1

Optimal offline packet scheduling on an energy harvesting broadcast link 能量收集广播链路的最优离线分组调度

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

F. M. Ozcelik, Hakan Erkal, E. Uysal-Biyikoglu, mehmet. ozcelik

引用次数: 6