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

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

筛选
英文 中文
Nonasymptotic upper bounds on the probability of the epsilon-atypical set for Markov chains 马尔可夫链的非典型集概率的非渐近上界
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365260
L. A. Lastras-Montaño
{"title":"Nonasymptotic upper bounds on the probability of the epsilon-atypical set for Markov chains","authors":"L. A. Lastras-Montaño","doi":"10.1109/ISIT.2004.1365260","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365260","url":null,"abstract":"For a stationary, irreducible and aperiodic Markov chain with finite alphabet A, starting symbol X/sub 0/=/spl sigma/, transition probability matrix P, stationary distribution /spl pi/, support S(/spl pi/,P)={(j,k):/spl pi//sub j/P/sub k|j/>0} and for a function f such that M=/spl Delta/E/sub /spl pi/P/f(X/sub 1/,X/sub 2/) 0/{K/sub n//(1+K/sub n/)}/spl epsiv//(max/sub j,k:P(k|j)/>0|f(j,k)|]/sup 2/ where K/sub n/=(1-|A|max/sub j,k/|P/sub k|j//sup n/-/spl pi//sub k/)/n). Under the conditions stated, the set over which the sup is taken is nonempty and therefore the sup exists and is positive; it is also shown that the sup is attained at a finite value of n. A nonasymptotic version of this result is also given based on the method of Markov types.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77107366","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
The weak information projection 弱信息投射
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365066
P. Harremoës
{"title":"The weak information projection","authors":"P. Harremoës","doi":"10.1109/ISIT.2004.1365066","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365066","url":null,"abstract":"A new projection is defined via data compression. Often it equals the generalized information projection, but if the projections differ, the weak information projection has better properties.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82780056","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
Channel coherence in the low SNR regime 低信噪比下的信道相干性
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365450
Lizhong Zheng, David Tse, M. Médard
{"title":"Channel coherence in the low SNR regime","authors":"Lizhong Zheng, David Tse, M. Médard","doi":"10.1109/ISIT.2004.1365450","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365450","url":null,"abstract":"The effect of channel coherence on the capacity and energy efficiency of noncoherent fading channels at low SNR is studied. A simple characterization is given, and a new approach is developed, which can be used to study a wide variety of problems for communications over a wideband channel. The flat block fading channel is studied, which transmits one scalar symbol per symbol time distorted by a multiplicative fading coefficient and the additive Gaussian noise.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85805998","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}
引用次数: 22
On the optimality of symbol by symbol filtering and denoising 用符号滤波和去噪研究符号的最优性
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365235
E. Ordentlich, T. Weissman
{"title":"On the optimality of symbol by symbol filtering and denoising","authors":"E. Ordentlich, T. Weissman","doi":"10.1109/ISIT.2004.1365235","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365235","url":null,"abstract":"This paper describes the optimality of symbol by symbol filtering and denoising and considers the problem of optimally recovering a discrete-time valued stochastic process from a noisy observation process. For binary Markov input process singlet filtering and denoising are optimal. Finally, for the case of memoryless channel, large deviations performance of singlet filtering is obtained.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89148298","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
Exponential error bounds for algebraic soft-decision decoding of Reed Solomon codes 里德索罗门码的代数软判决译码的指数误差界
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365455
N. Ratnakar, R. Koetter
{"title":"Exponential error bounds for algebraic soft-decision decoding of Reed Solomon codes","authors":"N. Ratnakar, R. Koetter","doi":"10.1109/ISIT.2004.1365455","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365455","url":null,"abstract":"This paper describes an algebraic soft decision (ASD) decoding algorithms of Reed Solomon codes, which assigns suitable weighted-interpolation and factorization algorithms. The probability of exponential error with an output alphabet multiplicity matrix M is used for decoding the received symbols when ASD algorithm is upper bound. Under the probability of error metric, these algorithms perform better in discrete, memoryless channel.","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85749470","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
Multiple-wavelength optical orthogonal codes under prime-sequence permutations 素数序列置换下的多波长光学正交码
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365404
Guu-chang Yang, W. Kwong, Cheng-Yuan Chang
{"title":"Multiple-wavelength optical orthogonal codes under prime-sequence permutations","authors":"Guu-chang Yang, W. Kwong, Cheng-Yuan Chang","doi":"10.1109/ISIT.2004.1365404","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365404","url":null,"abstract":"In this paper, a new family of wavelength-time codes, called multiple-wavelength optical orthogonal codes (MWOOCs), is constructed. The new codes use prime sequences for wavelength permutations on top of a time-spreading OOC. The advantage is that the code cardinality is a quadratic function of the number of wavelengths. This property is particularly useful in high bit-rate optical CDMA applications, in which the number of time slots is very restricted. This limitation can be compensated and even improved in our MWOOCs by increasing the number of available wavelengths, through the use of lasers with broadened supercontinuum spectrum","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81058404","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
Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks 大型扩展自组织无线网络容量的信息理论上限
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-06-27 DOI: 10.1109/ISIT.2004.1365407
O. Lévêque, E. Telatar
{"title":"Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networks","authors":"O. Lévêque, E. Telatar","doi":"10.1109/ISIT.2004.1365407","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365407","url":null,"abstract":"We derive an information theoretic upper bound on the maximum achievable rate per communication pair in a large extended ad-hoc wireless network. We show that under a reasonably weak assumption on the attenuation due to environment, this rate tends to zero as the number of users gets large","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91494947","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}
引用次数: 66
On the maximum entropy theorem for complex random vectors 关于复随机向量的最大熵定理
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-01-01 DOI: 10.1109/ISIT.2004.1365078
G. Tauböck
{"title":"On the maximum entropy theorem for complex random vectors","authors":"G. Tauböck","doi":"10.1109/ISIT.2004.1365078","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365078","url":null,"abstract":"This paper considers the complex random vectors and study some important properties. We develop a theory which is based on the concept of covariance and pseudo-covariance matrix in order to prove a stronger version of the maximum entropy theorem for the complex multivariate case (F.D. Neeser et al. 1993).","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78791126","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
Secret key agreement from correlated source outputs using LDPC matrices 使用LDPC矩阵从相关源输出达成密钥协议
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-01-01 DOI: 10.1109/ISIT.2004.1365051
J. Muramatsu
{"title":"Secret key agreement from correlated source outputs using LDPC matrices","authors":"J. Muramatsu","doi":"10.1109/ISIT.2004.1365051","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365051","url":null,"abstract":"","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77746506","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
Vandermonde-cocyclic codes and a suitable DFT 范德蒙德共环码和合适的DFT
International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications Pub Date : 2004-01-01 DOI: 10.1109/ISIT.2004.1365294
K. Gowda, B. Rajan
{"title":"Vandermonde-cocyclic codes and a suitable DFT","authors":"K. Gowda, B. Rajan","doi":"10.1109/ISIT.2004.1365294","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365294","url":null,"abstract":"","PeriodicalId":92224,"journal":{"name":"International Symposium on Information Theory and its Applications. International Symposium on Information Theory and its Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77044502","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
首页 上一页
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学术官方微信