发布求助
文献互助 智能选刊 最新文献

2011 IEEE International Symposium on Information Theory Proceedings最新文献

筛选
英文 中文
Cascade and Triangular source coding with causal side information 具有因果侧信息的级联和三角源编码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033832
Yeow-Khiang Chia, T. Weissman
{"title":"Cascade and Triangular source coding with causal side information","authors":"Yeow-Khiang Chia, T. Weissman","doi":"10.1109/ISIT.2011.6033832","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033832","url":null,"abstract":"We consider cascade and triangular source coding with side information and causal reconstruction at the end node. When the side information at the source and intermediate nodes are the same, we characterize the rate distortion regions for both the cascade and triangular source coding problems. For the general cascade setting with causal reconstruction at the end node, we characterize the rate region when the sources satisfy a positivity condition, or when a Markov chain holds.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130177046","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}
引用次数: 3
A concatenated coding scheme based on folded Reed-Solomon codes 基于折叠Reed-Solomon码的串联编码方案
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033682
P. Trifonov, M. Lee
{"title":"A concatenated coding scheme based on folded Reed-Solomon codes","authors":"P. Trifonov, M. Lee","doi":"10.1109/ISIT.2011.6033682","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033682","url":null,"abstract":"A concatenated code construction based on folded Reed-Solomon codes and short inner linear block codes is proposed. A generalization of the Das-Vardy weight assignment scheme to the case of multivariate interpolation decoding is developed. The decoding algorithm for the proposed construction makes use of the weighted version of the Guruswami-Rudra list decoding algorithm and list decoding of inner codes.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129314262","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}
引用次数: 1
The capacity region of a class of 3-receiver broadcast channels with two eavesdroppers 一类具有两个窃听器的3接收器广播信道的容量区域
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034283
Sadaf Salehkalaibar, M. Aref
{"title":"The capacity region of a class of 3-receiver broadcast channels with two eavesdroppers","authors":"Sadaf Salehkalaibar, M. Aref","doi":"10.1109/ISIT.2011.6034283","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034283","url":null,"abstract":"In this paper, we consider the 3-receiver broadcast channel with one common and two confidential messages. One of the confidential messages is sent to the first and second receivers and kept secret from the third receiver (eavesdropper). The other confidential message is sent to the first receiver and kept secret from the second and third receivers (eavesdroppers). The common message is decoded by all receivers. We study some special cases of the model and determine their secrecy capacity regions.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128031637","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}
引用次数: 4
Characterization of a part of the rate distortion region for the gaussian distributed source coding 高斯分布信源编码中部分率失真区域的表征
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034193
Y. Oohama
{"title":"Characterization of a part of the rate distortion region for the gaussian distributed source coding","authors":"Y. Oohama","doi":"10.1109/ISIT.2011.6034193","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034193","url":null,"abstract":"We consider the distributed source coding system of L correlated Gaussian sources Y<inf>i</inf>, i = 1, 2, …, L. We assume that Y <sup>L</sup> = <sup>t</sup>(Y<inf>1</inf>, Y<inf>2</inf>, …, Y<inf>L</inf>) is an observation of the remote source vector X<sup>L</sup> = <sup>t</sup>(X<inf>1</inf>,X<inf>2</inf>, …, X<inf>L</inf>), having the formY<sup>L</sup> = X<sup>K</sup> + N<sup>L</sup>, where N<sup>L</sup> = <sup>t</sup>(N<inf>1</inf>,N<inf>2</inf>, …, N<inf>L</inf>) is a vector of L independent Gaussian random variables also independent of X<sup>L</sup>. In this system L correlated Gaussian observations are separately compressed by Lencoders and sent to the information processing center. In this paper, we study the multiterminal source coding problem where the decoder wishes to reconstruct the observation Y<sup>L</sup> = X<sup>L</sup> + N<sup>L</sup>. In the previous work the author derived inner and outer bounds of the rate distortion region and derived a matching condition of the above two bounds. In this paper, based on this matching condition, we give a detail analysis on a part of the inner bound where it coincides with the outer bound. We further study an explicit characterization of the sum rate part of the rate distortion region when the observed Gaussian sources have a certain symmetric property.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131136211","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
Deterministic algorithm for the cooperative data exchange problem 协同数据交换问题的确定性算法
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034157
N. Milosavljevic, S. Pawar, S. Rouayheb, M. Gastpar, K. Ramchandran
{"title":"Deterministic algorithm for the cooperative data exchange problem","authors":"N. Milosavljevic, S. Pawar, S. Rouayheb, M. Gastpar, K. Ramchandran","doi":"10.1109/ISIT.2011.6034157","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034157","url":null,"abstract":"In this paper we study the problem of data exchange, where each node in the system has a number of linear combinations of the data packets. Communicating over a public channel, the goal is for all nodes to reconstruct the entire set of the data packets in minimal total number of bits exchanged over the channel. We present a novel divide and conquer based architecture that determines the number of bits each node should transmit. This along with the well known fact, that it is sufficient for the nodes to broadcast linear combinations of their local information, provides a polynomial time deterministic algorithm for reconstructing the entire set of the data packets at all nodes in minimal amount of total communication.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235715","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}
引用次数: 50
Equivalence between minimal generative model graphs and directed information graphs 最小生成模型图与有向信息图的等价性
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034116
Christopher J. Quinn, N. Kiyavash, T. Coleman
{"title":"Equivalence between minimal generative model graphs and directed information graphs","authors":"Christopher J. Quinn, N. Kiyavash, T. Coleman","doi":"10.1109/ISIT.2011.6034116","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034116","url":null,"abstract":"We propose a new type of probabilistic graphical model, based on directed information, to represent the causal dynamics between processes in a stochastic system. We show the practical significance of such graphs by proving their equivalence to generative model graphs which succinctly summarize interdependencies for causal dynamical systems under mild assumptions. This equivalence means that directed information graphs may be used for causal inference and learning tasks in the same manner Bayesian networks are used for correlative statistical inference and learning.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128687699","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}
引用次数: 26
An additive exponential noise channel with a transmission deadline 具有传输截止时间的加性指数噪声信道
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6034227
Yi-Lin Tsai, C. Rose, Ruochen Song, I. Mian
{"title":"An additive exponential noise channel with a transmission deadline","authors":"Yi-Lin Tsai, C. Rose, Ruochen Song, I. Mian","doi":"10.1109/ISIT.2011.6034227","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6034227","url":null,"abstract":"We derive the maximum mutual information for an additive exponential noise (AEN) channel with a peak input constraint. We find that the optimizing input density is mixed (with singularities) similar to previous results for AEN channels with a mean input constraint. Likewise, the maximum mutual information takes a similar form, though obviously the maximum for the peak constraint is smaller than for the corresponding mean-constrained channel. This model is inspired by multiple biological phenomena and processes which can be abstracted as follows: inscribed matter is sent by an emitter, moves through a medium, and arrives eventually at its destination receptor. The inscribed matter can convey information in a variety of ways such as the number of signaling quanta - molecules, macromolecular complexes, organelles, cells and tissues - that are emitted as well as the detailed pattern of their release. However, rather than focus on a general class of emitter-receptor systems or a particular exemplar of biomedical importance, our ultimate goal is to provide bounds on the potential efficacy of timed-release signaling for any system which emits identical signaling quanta. That is, we seek to apply one of the most potent aspects of information theory to biological signaling - mechanism blindness - in the hopes of gaining insights applicable to diverse systems that span a wide range of spatiotemporal scales.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127686285","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}
引用次数: 15
Capacity of less noisy relay channels 低噪声中继信道的容量
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033799
Si-Hyeon Lee, Sae-Young Chung
{"title":"Capacity of less noisy relay channels","authors":"Si-Hyeon Lee, Sae-Young Chung","doi":"10.1109/ISIT.2011.6033799","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033799","url":null,"abstract":"In this paper, we characterize the capacity of two new classes of relay channels, which we call more capable and less noisy relay channels. In these relay channels, the channel seen by the relay is stronger than that seen by the destination in a certain sense, which resembles the conditions for the more capable and less noisy broadcast channels. In more capable relay channels, decode-and-forward (DF) is shown to be optimal. The more capable relay channel includes as special cases several examples in the literature where DF is shown to be optimal. In less noisy relay channels, partial decode-and-forward (PDF) is shown to achieve the capacity. This is the third class of relay channels where PDF is shown to be optimal, where two previously known classes are the semideterministic relay channel and the relay channel with orthogonal components at the source. By using the definition of less noisy relay channel, we can easily construct many examples where DF is strictly suboptimal but PDF is capacity achieving.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122408085","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
Practical network coding on three-node point-to-point relay networks 三节点点对点中继网络的实用网络编码
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033917
S. Fong, M. Fan, R. Yeung
{"title":"Practical network coding on three-node point-to-point relay networks","authors":"S. Fong, M. Fan, R. Yeung","doi":"10.1109/ISIT.2011.6033917","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033917","url":null,"abstract":"We study the three-node point-to-point relay network which consists of two terminal nodes and one relay node between them and investigate practical network coding schemes for the network. The rate region achievable by the practical network coding schemes is obtained, and a procedure for constructing the linear network codes that achieve the rate pairs in the achievable rate region is presented. In addition, we show that the use of network coding rather than routing alone enlarges the achievable rate region, in particular increases the maximum equal-rate throughput.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121084513","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}
引用次数: 10
The discrete Fourier transform over a finite field with reduced multiplicative complexity 有限域上的离散傅里叶变换，具有降低的乘法复杂度
2011 IEEE International Symposium on Information Theory Proceedings Pub Date : 2011-10-03 DOI: 10.1109/ISIT.2011.6033725
Sergei V. Fedorenko
{"title":"The discrete Fourier transform over a finite field with reduced multiplicative complexity","authors":"Sergei V. Fedorenko","doi":"10.1109/ISIT.2011.6033725","DOIUrl":"https://doi.org/10.1109/ISIT.2011.6033725","url":null,"abstract":"A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. The theorem about the multiplicative complexity coincidence of the Goertzel and cyclotomic algorithms is proved.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122375967","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
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信