2012 IEEE Information Theory Workshop最新文献_第3页

Capacity of a class of relay channels with state 一类具有状态的中继通道的容量

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

Iñaki Estella Aguerri, Deniz Gündüz

引用次数: 4

Characterizing pseudoentropy 描述pseudoentropy

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

S. Vadhan, C. Zheng

引用次数: 3

On uncoded transmission and blocklength 关于非编码传输和块长度

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

Y. Kochman, G. Wornell

引用次数: 3

Reduced complexity window decoding schedules for coupled LDPC codes 降低了耦合LDPC码的复杂度窗口解码时间表

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

N. Hassan, A. E. Pusane, M. Lentmaier, G. Fettweis, D. Costello

引用次数: 14

Non-binary protograph-based LDPC codes for short block-lengths 短块长度的非二进制基于原型的LDPC代码

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

Ben-Yue Chang, D. Divsalar, L. Dolecek

引用次数: 38

A new achievable region for Gaussian multiple descriptions based on subset typicality 基于子集典型性的高斯多重描述新可实现区域

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

Kumar Viswanatha, E. Akyol, K. Rose

{"title":"A new achievable region for Gaussian multiple descriptions based on subset typicality","authors":"Kumar Viswanatha, E. Akyol, K. Rose","doi":"10.1109/ITW.2012.6404715","DOIUrl":"https://doi.org/10.1109/ITW.2012.6404715","url":null,"abstract":"This paper addresses the L-channel multiple descriptions problem for a Gaussian source under mean squared error (MSE) distortion metric. We focus on particular cross-sections of the general rate-distortion region where a subset the 2L - 1 distortion constraints are not imposed. Specifically, we assume that certain descriptions are never received simultaneously at the decoder and thereby the transmitted codewords require joint typicality only within prescribed subsets. We derive a new encoding scheme and an associated rate-distortion region wherein joint typicality of codewords only within the prescribed subsets is maintained. We show that enforcing joint typicality of all the codewords entails strict suboptimality in the achievable rate-distortion region. Specifically, we consider a 3 descriptions scenario wherein descriptions 1 and 3 are never received simultaneously at the decoder and show that a strictly larger achievable region is obtained when the encoder maintains joint typicality of codewords only within the required subsets. To prove these results, we derive a lemma called the `subset typicality lemma' which plays a critical role in establishing the new achievable region.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"12 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":"116754659","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}

引用次数: 0

On secure multiparty sampling for more than two parties 关于两方以上的安全多方抽样

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

M. Prabhakaran, V. Prabhakaran

引用次数: 14

Combining superposition coding and binning achieves capacity for the Gaussian cognitive interference channel 将叠加编码与分组相结合，实现了高斯认知干扰信道的容量

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

S. Rini, E. Kurniawan, A. Goldsmith

引用次数: 9

Retargeting LT codes using XORs at the relay 在继电器上使用xor重新定位LT代码

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

Shirish S. Karande

引用次数: 2

Approaching maximum likelihood decoding of finite length LDPC codes via FAID diversity 利用FAID分集逼近有限长度LDPC码的最大似然译码

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

D. Declercq, Erbao Li, B. Vasic, S. Planjery

引用次数: 8