2007 IEEE International Symposium on Information Theory最新文献_第5页

New Bounds on the Rate-Distortion Function of a Binary Markov Source 二元马尔可夫源的率失真函数的新界

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557286

S. Jalali, T. Weissman

引用次数: 20

Compound conditional source coding, Slepian-Wolf list decoding, and applications to media coding 复合条件源编码，睡眠-狼列表解码，以及在媒体编码中的应用

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557436

S. Draper, E. Martinian

引用次数: 22

Capacity Theorems for Relay Channels with Confidential Messages 具有机密消息的中继信道的容量定理

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557113

Y. Oohama

{"title":"Capacity Theorems for Relay Channels with Confidential Messages","authors":"Y. Oohama","doi":"10.1109/ISIT.2007.4557113","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557113","url":null,"abstract":"We consider a relay channel where a relay helps the transmission of messages from one sender to one receiver. The relay is considered not only as a sender that helps the message transmission but as a wire-tapper who can obtain some knowledge about the transmitted messages. In this paper we study the coding problem of the relay channel under the situation that some of transmitted messages are confidential to the relay. A security of such confidential messages is measured by the conditional entropy. The rate region is defined by the set of transmission rates for which messages are reliably transmitted and the security of confidential messages is larger than a prescribed level. In this paper we give two definition of the rate region. We first define the rate region in the case of deterministic encoder and call it the deterministic rate region. Next, we define the rate region in the case of stochastic encoder and call it the stochastic rate region. We derive explicit inner and outer bounds for the above two rate regions and present a class of relay channels where two bounds match. From the derived results, we can see that stochastic encoder can enlarge the rate region. We also evaluate the deterministic rate region of the Gaussian relay channel with confidential messages.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115840072","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}

引用次数: 102

Turbo Decoding of Product Codes based on the Modified Adaptive Belief Propagation Algorithm 基于改进自适应信念传播算法的产品码Turbo译码

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557297

C. Jégo, W. Gross

引用次数: 11

Effective LLL Reduction for Lattice Decoding 格解码的有效LLL降低

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557226

Cong Ling, Nick Howgrave-Graham

引用次数: 74

On Outage Capacity of MIMO Poisson Fading Channels MIMO泊松衰落信道的中断容量研究

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557582

Kaushik Chakraborty, S. Dey, M. Franceschetti

引用次数: 3

Coding Schemes for an Erasure Relay Channel 擦除中继信道的编码方案

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557301

Srinath Puducheri-Sundaravaradhan, J. Kliewer, T. Fuja

引用次数: 1

On The Duality Between Rate And Power Optimizations 论速率优化与功率优化的对偶性

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557642

Arun Padakandla, R. Sundaresan

引用次数: 0

Integer Polar Coordinates for Compression 用于压缩的整数极坐标

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557373

Demba E. Ba, Vivek K Goyal

引用次数: 1

Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes 一阶Reed-Muller码的线性复杂度软判决表译码

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557410

I. Dumer, G. Kabatiansky, C. Tavernier

{"title":"Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes","authors":"I. Dumer, G. Kabatiansky, C. Tavernier","doi":"10.1109/ISIT.2007.4557410","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557410","url":null,"abstract":"Soft-decision decoding on a memoryless channel is considered for the first-order Reed-Muller codes RM(1,m) of length 2m. We assume that different positions j of the received binary vector y can be corrupted by the errors of varying weight Wj. The generalized Hamming distance between vector y and any binary vector c is then defined as the sum of weighted differences Wj|yj - Cj| taken over all n positions. We obtain a tight upper bound Lt on the number of codewords located within generalized Hamming distance T from vector y, and design a decoding algorithm that outputs this list of codewords with complexity O(n In2 Lt)- In particular, all possible error weights wj equal 1 if this combinatorial model is applied to a binary symmetric channel. In this case, the well known Green algorithm performs full maximum likelihood decoding of RM(1,m) and requires O(n ln2 n) bit operations, whereas the Litsyn-Shekhovtsov algorithm operates within the bounded-distance decoding radius n/4 - 1 with linear complexity O(n). We close the performance-complexity gap between the two algorithms. Namely, for any fixed epsi isin (0, frac12), our algorithm outputs the complete list of codewords within the decoding radius n(frac12 - epsi) with linear complexity of order n ln2 epsi.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"7 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116860523","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