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

2012 International Symposium on Information Theory and its Applications最新文献

筛选
英文 中文
Fourier analysis of sequences over a composition algebra of the real number field 实数域复合代数上序列的傅里叶分析
2012 International Symposium on Information Theory and its Applications Pub Date : 2012-10-01 DOI: 10.1587/TRANSFUN.E96.A.2452
T. Maeda, Takafumi Hayashi
{"title":"Fourier analysis of sequences over a composition algebra of the real number field","authors":"T. Maeda, Takafumi Hayashi","doi":"10.1587/TRANSFUN.E96.A.2452","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E96.A.2452","url":null,"abstract":"To analyze the structure of a set of perfect sequences over a composition algebra of the real number field, transforms of a set of sequences similar to DFT (discrete Fourier transform) are introduced. Discrete cosine transform, discrete sine transform and generalized discrete Fourier transform (GDFT) of the sequences are defined and the fundamental properties of these transforms are proved. We show that GDFT is bijective and that there exists a relationship between these transforms and a convolution of sequences. Applying these properties to the set of perfect sequences, a parameterization theorem of such sequences is obtained.","PeriodicalId":369382,"journal":{"name":"2012 International Symposium on Information Theory and its Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117123876","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
Computing polynomial functions of correlated sources: Inner bounds 计算相关源的多项式函数:内界
2012 International Symposium on Information Theory and its Applications Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284664
Sheng Huang, M. Skoglund
{"title":"Computing polynomial functions of correlated sources: Inner bounds","authors":"Sheng Huang, M. Skoglund","doi":"10.1109/ISIT.2012.6284664","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284664","url":null,"abstract":"This paper considers the problem of source coding for computing functions of correlated i.i.d. random sources. The approach of combining standard and linear random coding for this problem was first introduced by Ahlswede and Han, in the special case of computing the modulo-two sum. In this paper, making use of an adapted version of that method, we generalize their result to more sophisticated scenarios, where the functions to be computed are polynomial functions. Since all discrete functions are fundamentally restrictions of polynomial functions, our results are universally applied.","PeriodicalId":369382,"journal":{"name":"2012 International Symposium on Information Theory and its Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125139967","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
Probabilistic analysis of the network reliability problem on a random graph ensemble 随机图集成下网络可靠性问题的概率分析
2012 International Symposium on Information Theory and its Applications Pub Date : 2011-05-30 DOI: 10.1587/TRANSFUN.E99.A.2218
Akiyuki Yano, T. Wadayama
{"title":"Probabilistic analysis of the network reliability problem on a random graph ensemble","authors":"Akiyuki Yano, T. Wadayama","doi":"10.1587/TRANSFUN.E99.A.2218","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E99.A.2218","url":null,"abstract":"In the field of computer science, the network reliability problem for evaluating the network failure probability has been extensively investigated. For a given undirected graph G, the network failure probability is the probability that edge failures (i.e., edge erasures) make G unconnected. Edge failures are assumed to occur independently with the same probability. The main contributions of the present paper are the upper and lower bounds on the expected network failure probability. We herein assume a simple random graph ensemble that is closely related to the Erdos-Rényi random graph ensemble. These upper and lower bounds exhibit the typical behavior of the network failure probability. The proof is based on the fact that the cutset space of G is a linear space over F2 spanned by the incident matrix of G. The present study shows a close relationship between the ensemble analysis of the expected network failure probability and the ensemble analysis of the average weight distribution of LDGM codes with column weight 2.","PeriodicalId":369382,"journal":{"name":"2012 International Symposium on Information Theory and its Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117344736","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
On two strong converse theorems for discrete memoryless channels 离散无记忆信道的两个强逆定理
2012 International Symposium on Information Theory and its Applications Pub Date : 2010-08-06 DOI: 10.1587/TRANSFUN.E98.A.2471
Y. Oohama
{"title":"On two strong converse theorems for discrete memoryless channels","authors":"Y. Oohama","doi":"10.1587/TRANSFUN.E98.A.2471","DOIUrl":"https://doi.org/10.1587/TRANSFUN.E98.A.2471","url":null,"abstract":"In 1973, Arimoto proved the strong converse theorem for the discrete memoryless channels stating that when transmission rate R is above channel capacity C, the error probability of decoding goes to one as the block length n of code word tends to infinity. He proved the theorem by deriving the exponent function of error probability of correct decoding that is positive if and only if R >; C. Subsequently, in 1979, Dueck and Körner determined the optimal exponent of correct decoding. Arimoto's bound has been said to be equal to the bound of Dueck and Körner. However its rigorous proof has not been presented so far. In this paper we give a rigorous proof of the equivalence of Arimoto's bound to that of Dueck and Körner.","PeriodicalId":369382,"journal":{"name":"2012 International Symposium on Information Theory and its Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123509272","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}
引用次数: 7
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学术官方微信