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

On scalable coding in the presence of decoder side information 解码器侧信息存在时的可伸缩编码

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875194

E. Akyol, U. Mitra, E. Tuncel, K. Rose

{"title":"On scalable coding in the presence of decoder side information","authors":"E. Akyol, U. Mitra, E. Tuncel, K. Rose","doi":"10.1109/ISIT.2014.6875194","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875194","url":null,"abstract":"The problem of scalable coding while exploiting the decoder side information is considered. Prior work considered the two important cases concerning the degraded side information where source X and the side information variables (Y1, Y2) form a Markov chain in the order of either X - Y1 - Y2 or X - Y2 - Y1. While the encoding schemes for these settings differ considerably, they are both based on the combination of conditional codebook encoding, a standard tool in scalable coding, and random binning, conventionally used in decoder side information problems. In this paper, an encoding scheme is proposed solely on the basis of random binning, which essentially performs scalable and Wyner-Ziv coding simultaneously. Proposed scheme achieves the rate-distortion regions of prior results. A practical advantage of the unifying scheme is the fact that random binning can be realized via practical tools such as nested lattice codes and channel codes. Finally, motivated by the proposed encoding scheme, a network interpretation of scalable coding is considered. An achievable region is derived for this problem setting and the potential benefits of networked scalable coding are shown.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129876818","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

The feedback capacity of a class of finite state multiple access channels 一类有限状态多址信道的反馈容量

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875372

Jui Wu, A. Anastasopoulos

引用次数: 2

Orthogonal designs optimize achievable dispersion for coherent MISO channels 正交设计优化了相干MISO信道的可实现色散

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875289

Austin Collins, Yury Polyanskiy

引用次数: 21

Lossless coding of correlated sources with actions in acyclic directed networks 无循环有向网络中带动作相关源的无损编码

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875049

Oron Sabag, H. Permuter, A. Cohen

{"title":"Lossless coding of correlated sources with actions in acyclic directed networks","authors":"Oron Sabag, H. Permuter, A. Cohen","doi":"10.1109/ISIT.2014.6875049","DOIUrl":"https://doi.org/10.1109/ISIT.2014.6875049","url":null,"abstract":"This work studies the problem of distributed compression of correlated sources with an action-dependent joint distribution. This class of problems are in fact extensions of the Slepian-Wolf model, but where cost-constrained actions affect the generation of one of the sources. A network setup is investigated for the case where actions are taken at the encoder. The first source is available at a node in the network, this node can take actions which affect the generation of the other source which is available at different node in the network. Transmission occurs over a general, acyclic, directed network and both sources are required in a set of terminal nodes. The purpose of this work is to study the implications of actions on the set of achievable rates. For this network, generalized cut-set bounds are derived, and a full characterization of the set of achievable rates using single-letter expressions is provided, showing how actions affect the achievable region in a non-trivial manner. Random linear network coding is proved to be optimal in this setup, even though this is not a classical multicast problem. As a special case of this network we study a multi-user setup with two encoders and one decoder, each source is available to one encoder and transmission occurs over rate-limited link. The optimal rate region for this case is characterized, and calculated for a binary example.","PeriodicalId":127191,"journal":{"name":"2014 IEEE International Symposium on Information Theory","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127383890","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

Spatio-temporal graphical models for extreme events 极端事件的时空图形模型

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875190

Han Yu, Liaofan Zhang, J. Dauwels

引用次数: 3

New upper bounds for grain-correcting and grain-detecting codes 颗粒校正码和颗粒检测码的新上界

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875007

A. Sharov, R. Roth

引用次数: 1

Quadratic-backtracking algorithm for string reconstruction from substring compositions 从子字符串组成重构字符串的二次回溯算法

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875042

Jayadev Acharya, Hirakendu Das, O. Milenkovic, A. Orlitsky, Shengjun Pan

引用次数: 8

Revisiting the Slepian-Wolf coding problem for general sources: A direct approach 重新审视一般源码的睡狼编码问题:一种直接的方法

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875050

T. Uyematsu, Tetsunao Matsuta

引用次数: 5

A new achievability scheme for downlink multicell processing with finite backhaul capacity 有限回程容量下行多单元处理的一种新的可实现方案

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6874984

Nan Liu, Wei Kang

引用次数: 14

Early decoding for transmission over finite transport blocks 在有限传输块上传输的早期解码

2014 IEEE International Symposium on Information Theory Pub Date : 2014-08-11 DOI: 10.1109/ISIT.2014.6875095

Cenk Sahin, Lingjia Liu, E. Perrins

引用次数: 5