Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.最新文献_第4页

Maximum a posteriori decoding and turbo codes for general memoryless channels 最大后验解码和turbo码一般无内存信道

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523540

C. Méasson, R. Urbanke, A. Montanari, T. Richardson

引用次数: 18

Relative entropy and exponential deviation bounds for general Markov chains 一般马尔可夫链的相对熵和指数偏差界

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523607

Ioannis Kontoyiannis, L. A. Lastras-Montaño, Sean P. Meyn

引用次数: 49

On sensor network lifetime and data distortion 传感器网络寿命与数据失真

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523281

A. Kansal, A. Ramamoorthy, M. Srivastava, G. Pottie

引用次数: 46

Near separability of optimal multiple description source codes 近可分性的最优多重描述源代码

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523655

H. Feng

{"title":"Near separability of optimal multiple description source codes","authors":"H. Feng","doi":"10.1109/ISIT.2005.1523655","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523655","url":null,"abstract":"In this paper, we first present new upper and lower bounds for the rate loss of multiple description source codes (MDSCs). For a two-description MDSC (2DSC), the rate loss of description i with distortion Di is Li = Ri $R(Di ), i isin {1, 2}, where Ri is the rate of the ith description; the joint rate loss associated with decoding the two descriptions together to achieve central distortion D0 is L 0 = R1 + R2 - R(D0). We show that given any memoryless source with variance sigma2 and mean squared error distortion measure, for any optimal 2DSC, (a) 0 les L0 les 0.8802 if D0 les D1 + D2 - sigma2; (b) 0 les L1, L2 les 0.4401 if D0 ges (1/D1 + 1/D2 - 1/sigma2)-1; (c) 0 les L1, L2 les 0.3802 and R(max{D1, D2}) - 1 les L0 les R(max{D1, D2}) + 0.3802 otherwise. We also present a tighter bound on the distance between the El Gamal-Cover inner bound and the achievable region. In addition, these new bounds, which are easy to compute, inspire new designs of low-complexity near-optimal 2DSC. In essence, we demonstrate that any optimal 2DSC can be nearly separated into a multi-resolution source code and a traditional single-resolution code, and the resulting rate penalty for each description is less than 0.6901 bit/sample for general sources and less than 0.5 bit/sample for successively refinable sources","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132410677","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

Toward a theory of avalanche-creating and error-controlling encoding schemes 雪崩产生与错误控制编码方案的理论探讨

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523777

G. Malewicz

引用次数: 1

A universal scheme for learning 学习的通用方案

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523523

V. Farias, C. Moallemi, Benjamin Van Roy, T. Weissman

引用次数: 0

Sequential random binning for streaming distributed source coding 流式分布式源编码的顺序随机分组

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523572

S. Draper, Cheng Chang, A. Sahai

引用次数: 20

On the rate loss and construction of source codes for broadcast channels 广播信道码率损失与码结构研究

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523297

H. Feng, M. Effros

{"title":"On the rate loss and construction of source codes for broadcast channels","authors":"H. Feng, M. Effros","doi":"10.1109/ISIT.2005.1523297","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523297","url":null,"abstract":"In this paper, we first define and bound the rate loss of source codes for broadcast channels. Our broadcast channel model comprises one transmitter and two receivers; the transmitter is connected to each receiver by a private channel and to both receivers by a common channel. The transmitter sends a description of source (X, Y) through these channels, receiver 1 reconstructs X with distortion D1, and receiver 2 reconstructs Y with distortion D2. Suppose the rates of the common channel and private channels 1 and 2 are R0, R1, and R2, respectively. The work of Gray and Wyner gives a complete characterization of all achievable rate triples (R0,R1,R2) given any distortion pair (D1,D2). In this paper, we define the rate loss as the gap between the achievable region and the outer bound composed by the rate-distortion functions, i.e., R0+R1+R2 ≥ RX,Y (D1,D2), R0 + R1 ≥ RX(D1), and R0 + R2 ≥ RY (D2). We upper bound the rate loss for general sources by functions of distortions and upper bound the rate loss for Gaussian sources by constants, which implies that though the outer bound is generally not achievable, it may be quite close to the achievable region. This also bounds the gap between the achievable region and the inner bound proposed by Gray and Wyner and bounds the performance penalty associated with using separate decoders rather than joint decoders. We then construct such source codes using entropy-constrained dithered quantizers. The resulting implementation has low complexity and performance close to the theoretical optimum. In particular, the gap between its performance and the theoretical optimum can be bounded from above by constants for Gaussian sources.","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132598530","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

Error-correcting signature code for multiple-access adder channel 多址加法器信道的纠错签名码

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523703

Jun Cheng, K. Kamoi, Y. Watanabe

引用次数: 4

One-to-one code and its anti-redundancy 一对一编码及其抗冗余性

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI: 10.1109/ISIT.2005.1523599

W. Szpankowski

{"title":"One-to-one code and its anti-redundancy","authors":"W. Szpankowski","doi":"10.1109/ISIT.2005.1523599","DOIUrl":"https://doi.org/10.1109/ISIT.2005.1523599","url":null,"abstract":"One-to-one codes are \"one shot\" codes that assign a distinct codeword to source symbols and are not necessarily prefix codes (more generally, uniquely decodable). For example, such codes arise when there exists an \"end of message\" channel symbol. Interestingly, as Wyner proved in 1972, for such codes the average code length can be smaller than the source entropy. By how much? We call this difference the anti-redundancy. Various authors over the years have shown that the anti-redundancy can be as big as minus the logarithm of the source entropy. However, to the best of our knowledge precise estimates do not exist. In this note, we consider a block code of length n generated by a binary memoryless source, and prove that the average anti-redundancy is -(1/2)log2n + C + F(n) + o(1) where C is a constant and either F(n) = O if log2(1 - p)/p is irrational (where p is the probability of generating a \"0\") or otherwise F(ri) is a fluctuating function as the code length increases. This relatively simple finding requires a combination of quite sophisticated analytic tools such as precise evaluation of Bernoulli sums, the saddle point method, and theory of distribution of sequences modulo 1","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130980474","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