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

2009 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Exact erasure channel density evolution for protograph-based generalized LDPC codes 基于原型的广义LDPC码的精确擦除信道密度演化
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205688
M. Lentmaier, M. Tavares, G. Fettweis
{"title":"Exact erasure channel density evolution for protograph-based generalized LDPC codes","authors":"M. Lentmaier, M. Tavares, G. Fettweis","doi":"10.1109/ISIT.2009.5205688","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205688","url":null,"abstract":"We derive explicit density evolution equations for protograph-based generalized LDPC codes on the binary erasure channel. They are obtained from an analysis of multi-dimensional input/output transfer functions of the component decoders. Belief propagation decoding with optimal component APP decoders is considered. Based on the resulting transfer functions, a threshold analysis is performed for some protograph examples.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123868950","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}
引用次数: 20
New decoding algorithms for a class of subsystem codes and generalized shor codes 一类子系统码和广义短码的新译码算法
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205650
P. Sarvepalli, A. Klappenecker, M. Rötteler
{"title":"New decoding algorithms for a class of subsystem codes and generalized shor codes","authors":"P. Sarvepalli, A. Klappenecker, M. Rötteler","doi":"10.1109/ISIT.2009.5205650","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205650","url":null,"abstract":"In this paper we give new decoding algorithms for the generalized Shor codes and a class of subsystem codes due to Bacon and Casaccino. Our interest in these codes stems from the fact these codes can allow us to construct quantum codes from non-dual containing codes. In this paper we show how to decode these codes efficiently.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123903212","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
Information embedding with reversible stegotext 可逆隐文本信息嵌入
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205855
O. Sumszyk, Y. Steinberg
{"title":"Information embedding with reversible stegotext","authors":"O. Sumszyk, Y. Steinberg","doi":"10.1109/ISIT.2009.5205855","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205855","url":null,"abstract":"Information embedding is the transmission of an independent data embedded into a host signal via a noisy channel. Reversible information embedding (RIE) extends this model by adding the requirement of decoding the host signal. In some applications however, this requirement is too strong. For example, if the user is interested in decoding the data and further transmitting the stegotext, i.e. the result of the embedding of independent data into the host, then full decoding of the host is not needed, only re-production of the stegotext. This work expands the study of information embedding channels by adding the requirement of retrieving the stegotext at the destination. A single-letter characterization of the achievable rate-distortion region is developed. In particular, it is shown that a rate higher than the RIE rate can be achieved, under the (more relaxed) requirement of stegotext decoding. Two examples are solved, and an iterative algorithm that computes numerically the capacity is provided.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125192925","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
The delay region for P2P file transfer P2P文件传输的延迟区域
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205610
Yunnan Wu, Y. C. Hu, Jin Li, P. Chou
{"title":"The delay region for P2P file transfer","authors":"Yunnan Wu, Y. C. Hu, Jin Li, P. Chou","doi":"10.1109/ISIT.2009.5205610","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205610","url":null,"abstract":"Motivated by P2P file transfer applications (e.g., BitTorrent) on the Internet, this paper considers the problem of delivering a file from a server to multiple receivers in a P2P network. Each receiver has an associated delay in receiving the file. We aim at understanding the optimal delay region, i.e., the set of all possible delay vectors that can be achieved. Previous work has addressed the problem of delivering the file to all receivers in minimum amount of time (equivalently, minimizing the maximum delay to the receivers), assuming peer uplinks are the only bottleneck in the network. This paper shows that it is in fact possible to significantly reduce the average delay at a slight increase in the maximum delay. Moreover, given an order at which the receivers finish downloading, the optimal delay region is characterized by a system of linear inequalities. Any point in the optimal delay region can be achieved by linear network coding. We also propose a simple routing scheme that has near-optimal empirical performance.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125365405","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}
引用次数: 13
Influence in a large society: Interplay between information dynamics and network structure 大社会中的影响:信息动态和网络结构之间的相互作用
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205820
L. Dolecek, D. Shah
{"title":"Influence in a large society: Interplay between information dynamics and network structure","authors":"L. Dolecek, D. Shah","doi":"10.1109/ISIT.2009.5205820","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205820","url":null,"abstract":"Motivated by the recent emergence of large online social networks, we seek to understand the effects the underlying social network (graph) structure and the information dynamics have on the creation of influence of an individual. We examine a natural model for information dynamics under two important temporal scales: a first impression setting and a long— term or equilibrated setting. We obtain a characterization of relevant network structures under these temporal aspects, thereby allowing us to formalize the existence of influential agents. Specifically, we find that the existence of an influential agent corresponds to: (a) strictly positive information theoretic capacity over an infinite-sized noisy broadcast tree network in the first impression case, and (b) positive recurrent property of an appropriate (countable state space) Markov chain in the long-term case. As an application of our results, we evaluate the parameter space of the popular “small world” network model to identify when the network structure supports the existence of influential agents.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129845268","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
Power-constrained communications using LDLC lattices 使用LDLC晶格的功率限制通信
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205635
J. Dauwels, Hans-Andrea Loeliger, B. Kurkoski
{"title":"Power-constrained communications using LDLC lattices","authors":"J. Dauwels, Hans-Andrea Loeliger, B. Kurkoski","doi":"10.1109/ISIT.2009.5205635","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205635","url":null,"abstract":"An explicit code construction for using low-density lattice codes (LDLC) on the constrained power AWGN channel is given. LDLC lattices can be decoded in high dimension, so that the code relies on the Euclidean distance between codepoints. A sublattice of the coding lattice is used for code shaping. Lattice codes are designed using the continuous approximation, which allows separating the contribution of the shaping region and coding lattice to the total transmit power. Shaping and lattice decoding are both performed using a belief-propagation decoding algorithm. At a rate of 3 bits per dimension, a dimension 100 code which is 3.6 dB from the sphere bound is found.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130256692","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}
引用次数: 19
Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types 基于类型方法的Reed-Solomon码代数软译码的多重赋值
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205964
Hirakendu Das, A. Vardy
{"title":"Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types","authors":"Hirakendu Das, A. Vardy","doi":"10.1109/ISIT.2009.5205964","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205964","url":null,"abstract":"The probability of error in the Koetter-Vardy algebraic soft-decoding algorithm for Reed-Solomon codes is determined by the multiplicity assignment scheme used. A multiplicity assignment scheme converts the reliability matrix Π, consisting of the probabilities observed at the channel output, into a multiplicity matrix M that specifies the algebraic interpolation conditions. Using the method of types, Sanov's theorem in particular, we obtain tight exponential bounds on the probability of decoding error for a given multiplicity matrix. These bounds turn out to be essentially the same as the Chernoff bound. We establish several interesting properties of the multiplicity matrix M† which minimizes the exponent of the probability of error. Based on these observations, we develop a low-complexity multiplicity assignment scheme which uses nested bisection to solve for M†. This scheme provides the same probability of error as a known scheme based upon the Chernoff bound, but with much lower complexity. We also derive a simple condition on the reliability matrix Π which guarantees an exponentially small probability of error. This condition is akin to an error-correction radius, and can be used to study the performance of algebraic soft-decoding.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"148 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128864795","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
On the DMT of bidirectional relaying with limited feedback 有限反馈双向中继的DMT问题
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205609
Thanh Tùng Kim, H. Poor
{"title":"On the DMT of bidirectional relaying with limited feedback","authors":"Thanh Tùng Kim, H. Poor","doi":"10.1109/ISIT.2009.5205609","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205609","url":null,"abstract":"Several half-duplex decode-and-forward two-way relaying protocols that efficiently exploit quantized channel state information (CSI) at the transmitters (CSIT) are investigated. Adapting the number of channel uses for each relaying phase and the transmit power based on limited CSIT is shown to result in a significant improvement in the diversity-multiplexing tradeoff (DMT). With CSI feedback from relay to sources, allocating the number of channel uses is sufficient to match the performance of power allocation. However, power control is instrumental to efficiently exploit CSI feedback from sources to relay.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121894612","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}
引用次数: 12
New sum-rate upper bound for the two-user Gaussian interference channel 双用户高斯干涉信道的新和速率上界
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205991
R. Etkin
{"title":"New sum-rate upper bound for the two-user Gaussian interference channel","authors":"R. Etkin","doi":"10.1109/ISIT.2009.5205991","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205991","url":null,"abstract":"A new upper bound for the sum-capacity of the two-user complex Gaussian interference channel is derived. The bound is based on genies that provide side information signals to the receivers. Various parameters are introduced to control the side information, which can be optimized to get the tightest possible bound. The new bound improves the performance of the best known bounds for sufficiently small cross-gains.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121984533","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}
引用次数: 19
Minimum description length and clustering with exemplars 最小的描述长度和聚类与范例
2009 IEEE International Symposium on Information Theory Pub Date : 2009-06-28 DOI: 10.1109/ISIT.2009.5205937
Po-Hsiang Lai, J. O’Sullivan, Robert Pless
{"title":"Minimum description length and clustering with exemplars","authors":"Po-Hsiang Lai, J. O’Sullivan, Robert Pless","doi":"10.1109/ISIT.2009.5205937","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205937","url":null,"abstract":"We propose an information-theoretic clustering framework for density-based clustering and similarity or distance-based clustering with objective functions of clustering performance derived from stochastic complexity and minimum description length (MDL) arguments. Under this framework, the number of clusters and parameters can be determined in a principled way without prior knowledge from users. We show that similarity-based clustering can be viewed as combinatorial optimization on graphs. We propose two clustering algorithms, one of which relies on a minimum arborescence tree algorithm which returns optimal clustering under the proposed MDL objective function for similarity-based clustering. We demonstrate clustering performance on synthetic data.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121092336","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
首页 上一页
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学术文献互助群
群 号：604180095
Book学术官方微信