2010 IEEE Information Theory Workshop最新文献_第10页

Achievable rate regions for Dirty Tape Channels and “joint writing on Dirty paper and Dirty Tape” 脏带通道和“在脏纸和脏带上联合书写”的可实现速率区域

2010 IEEE Information Theory Workshop Pub Date : 2010-04-15 DOI: 10.1109/CIG.2010.5592659

Reza Khosravi-Farsani, Bahareh Akhbari, M. Aref

{"title":"Achievable rate regions for Dirty Tape Channels and “joint writing on Dirty paper and Dirty Tape”","authors":"Reza Khosravi-Farsani, Bahareh Akhbari, M. Aref","doi":"10.1109/CIG.2010.5592659","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592659","url":null,"abstract":"We consider the Gaussian Dirty Tape Channel (DTC) Y = X + S + Z, where S is an additive Gaussian interference known causally to the transmitter. The general expression max<inf>PU, f(·), X = f(U, S)</inf> I(U; Y) is proposed for the capacity of this channel. For linear assignment to f(·), i.e., X = U — βS, this expression leads to the compensation strategy proposed previously by Willems to obtain an achievable rate for the DTC. We show that linear assignment to f(·) is optimal under the condition that there exists a real number β<sup>∗</sup> such that the pair (X + β S, U) is independent of the interference S. Furthermore, by applying a time-sharing technique to the achievable rate derived by linear assignment to f (·), an improved lower bound on the capacity of DTC is obtained. We also consider the Gaussian multiple access channel with additive interference, and study two different scenarios for this system. In the first case, both transmitters know interference causally while in the second, one transmitter has access to the interference noncausally and the other causally. Achievable rate regions for these two scenarios are then established.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125427717","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}

引用次数: 8

Sum capacity of K user Gaussian degraded interference channels K个用户高斯退化干扰信道的和容量

2010 IEEE Information Theory Workshop Pub Date : 2010-04-13 DOI: 10.1109/CIG.2010.5592668

J. Jose, S. Vishwanath

引用次数: 13

A new full-diversity criterion and low-complexity STBCs with Partial Interference Cancellation decoding 一种新的全分集准则和部分干扰抵消译码的低复杂度stbc

2010 IEEE Information Theory Workshop Pub Date : 2010-04-13 DOI: 10.1109/CIG.2010.5592752

Natarajan Lakshmi Prasad, B. Rajan

引用次数: 5

An achievable rate for the MIMO individual channel MIMO单个信道的可实现速率

2010 IEEE Information Theory Workshop Pub Date : 2010-04-12 DOI: 10.1109/CIG.2010.5592656

Y. Lomnitz, M. Feder

引用次数: 3

Structured LDPC codes from permutation matrices free of small trapping sets 不含小捕获集的排列矩阵的结构化LDPC码

2010 IEEE Information Theory Workshop Pub Date : 2010-04-07 DOI: 10.1109/CIG.2010.5592767

D. V. Nguyen, B. Vasic, M. Marcellin, S. K. Chilappagari

引用次数: 31

Dense error-correcting codes in the Lee metric 李度规中的密集纠错码

2010 IEEE Information Theory Workshop Pub Date : 2010-04-02 DOI: 10.1109/CIG.2010.5592743

T. Etzion, A. Vardy, Eitan Yaakobi

引用次数: 18

Network-level cooperative protocols for wireless multicasting: Stable throughput analysis and use of network coding 无线多播的网络级合作协议:稳定吞吐量分析和网络编码的使用

2010 IEEE Information Theory Workshop Pub Date : 2010-01-13 DOI: 10.1109/CIG.2010.5592701

Anthony Fanous, A. Ephremides

引用次数: 9

The enumeration of Costas arrays of order 28 顺序为28的Costas数组的枚举

2010 IEEE Information Theory Workshop Pub Date : 2008-06-18 DOI: 10.3934/amc.2011.5.69

Konstantinos Drakakis, Francesco Iorio, S. Rickard

引用次数: 40

Coding solutions for the secure biometric storage problem 安全生物识别存储问题的编码解决方案

2010 IEEE Information Theory Workshop Pub Date : 2007-01-16 DOI: 10.1109/CIG.2010.5592899

D. Schipani, J. Rosenthal

{"title":"Coding solutions for the secure biometric storage problem","authors":"D. Schipani, J. Rosenthal","doi":"10.1109/CIG.2010.5592899","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592899","url":null,"abstract":"The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a scheme where similar input strings will be accepted as the same biometric. In the same time nothing could be learned from the stored data. They called their scheme a fuzzy commitment scheme. In this paper we will revisit the solution of Juels and Wattenberg and we will provide answers to two important questions: what type of error-correcting codes should be used and what happens if biometric templates are not uniformly distributed, i.e. the biometric data come with redundancy. Answering the first question will lead us to the search for low-rate large-minimum distance error-correcting codes which come with efficient decoding algorithms up to the designed distance. In order to answer the second question we relate the rate required with a quantity connected to the “entropy” of the string, trying to estimate a sort of “capacity”, if we want to see a flavor of the converse of Shannon's noisy coding theorem. Finally we deal with side-problems arising in a practical implementation and we propose a possible solution to the main one that seems to have so far prevented in many situations real life applications of the fuzzy scheme.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130961872","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