2012 IEEE Information Theory Workshop最新文献

To code or not to code: Revisited 写代码还是不写代码:重访

2012 IEEE Information Theory Workshop Pub Date : 2012-12-01 DOI: 10.1109/ITW.2012.6404746

V. Kostina, S. Verdú

引用次数: 11

Aspect of security in the cognitive relay assisted interference channels 认知中继辅助干扰通道安全方面的研究

2012 IEEE Information Theory Workshop Pub Date : 2012-12-01 DOI: 10.1109/ITW.2012.6404758

Md. Zahurul I. Sarkar, T. Ratnarajah

引用次数: 8

Achievable rate regions for compound multiple access channel with channel state information 具有信道状态信息的复合多址信道的可实现速率区域

2012 IEEE Information Theory Workshop Pub Date : 2012-09-03 DOI: 10.1109/ITW.2012.6404764

Mostafa Monemizadeh, G. Hodtani

引用次数: 6

Sequential normalized maximum likelihood in log-loss prediction 对数损失预测中的顺序归一化最大似然

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404734

W. Kotłowski, P. Grünwald

引用次数: 5

On random binning versus conditional codebook methods in multiple descriptions coding 多描述编码中随机分组与条件码本方法的比较

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404683

E. Akyol, Kumar Viswanatha, K. Rose

{"title":"On random binning versus conditional codebook methods in multiple descriptions coding","authors":"E. Akyol, Kumar Viswanatha, K. Rose","doi":"10.1109/ITW.2012.6404683","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404683","url":null,"abstract":"There are two common types of encoding paradigms in multiple descriptions (MD) coding: i) an approach based on conditional codebook generation, which was originally initiated by El-Gamal and Cover for the 2 channel setting and later extended to more than 2 channels by Venkataramani, Kramer and Goyal (VKG), ii) and an approach based on Slepian and Wolf's random binning technique, proposed by Pradhan, Puri and Ramchandran (PPR) for L >; 2 descriptions. It is well known that the achievable region due to PPR subsumes the VKG region for the symmetric Gaussian MD problem. Motivated by several practical advantages of random binning based methods over the conditional codebook encoding, this paper focuses on the following important questions: Does a random binning based scheme achieve the performance of conditional codebook encoding, even for the 2 descriptions scenario? Are random binning based approaches beneficial for settings that are not fully symmetric? This paper answers both these questions in the affirmative. Specifically, we propose a 2 descriptions coding scheme, based on random binning, which subsumes the currently known largest region for this problem due to Zhang and Berger. Moreover, we propose its extensions to L >; 2 channels and derive the associated achievable regions. The proposed scheme enjoys the advantages of both encoding paradigms making it particularly useful when there is symmetry only within a subset of the descriptions.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123261516","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

Communication amid uncertainty 不确定环境下的沟通

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404647

M. Sudan

{"title":"Communication amid uncertainty","authors":"M. Sudan","doi":"10.1109/ITW.2012.6404647","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404647","url":null,"abstract":"The classical theory of communication, starting with the work of Shannon, has always that assumed the meaning of the messages being exchanged is known to the sender and receiver. This assumption set aside a tricky issue and allowed the theory to focus on the more pressing engineering problem of the time - namely communicating the bits efficiently and reliably. In the current times, we see increasing evidence that this question can no longer be set aside. On the one hand, communication of the bits have become very reliable, so reliability is no longer the pressing concern today. On the other hand, increasingly these bits are operated on by computers or mechanical devices. In such settings it becomes essential that the computers and machines know what the bits mean. In this article intended to accompany a talk to be given at the workshop, we describe some of our attempts to extract the notion of meaning, and the challenges this task poses. Meaning is best understood by focussing on the phenomenon of “misunderstanding”, i.e., when the receiver does not understand what the sender says. Misunderstanding, in turn, seems to emerge principally from “uncertainty”: Senders and receivers are uncertain about what the other knows/believes. We illustrate the problem in a simple setting, before moving on to describing our attempts to tackle the general complex task. Based on joint works with Brendan Juba (Harvard), Oded Goldreich (Weizmann), Adam Kalai (MSR New England), and Sanjeev Khanna (U. Penn.).","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126725286","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

Secret-key agreement over a non-coherent block-fading MIMO wiretap channel 非相干块衰落MIMO窃听信道上的密钥协议

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404646

Mattias Andersson, A. Khisti, M. Skoglund

引用次数: 7

Results on combinatorial joint source-channel coding 组合联合信信道编码的结果

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404637

Y. Kochman, A. Mazumdar, Yury Polyanskiy

引用次数: 15

Gaussian wiretap channel with a batteryless energy harvesting transmitter 高斯窃听信道与一个无电池能量收集发射器

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404771

Omur Ozel, E. Ekrem, S. Ulukus

引用次数: 6

Uniform random number generation by using sparse matrix 利用稀疏矩阵生成均匀随机数

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI: 10.1109/ITW.2012.6404748

J. Muramatsu, S. Miyake

引用次数: 5