Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365260
L. A. Lastras-Montaño
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.
对于具有有限字母a的平稳、不可约、非周期马尔可夫链，起始符号X/sub 0/=/spl sigma/，转移概率矩阵P，平稳分布/spl pi/，支持S(/spl pi/，P)={(j,k):/spl pi//sub j/P/sub k|j/>}，对于一个函数f M=/spl Delta/E/sub /spl pi/P/ 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)/ |f(j,k)|]/sup 2/其中k/ sub n/=(1-| a |max/sub j,k/|P/sub k|j/ sup n/-/spl pi//sub k/)/n)。在上述条件下，sup所处的集合是非空的，因此sup存在并且是正的;在有限的n值处，我们也得到了这一结果的一个非渐近版本。
{"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365066
P. Harremoës
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.
通过数据压缩定义新的投影。通常它等于广义信息投影，但如果投影不同，则弱信息投影具有更好的性质。
{"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365450
Lizhong Zheng, David Tse, M. Médard
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.
{"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365235
E. Ordentlich, T. Weissman
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.
{"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365455
N. Ratnakar, R. Koetter
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.
{"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365404
Guu-chang Yang, W. Kwong, Cheng-Yuan Chang
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
{"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}
Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365407
O. Lévêque, E. Telatar
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
{"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}
Pub Date : 2004-01-01DOI: 10.1109/ISIT.2004.1365078
G. Tauböck
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).
本文研究了复随机向量的一些重要性质。我们发展了一个基于协方差和伪协方差矩阵概念的理论，以证明复杂多元情况下最大熵定理的一个更强的版本(F.D. Neeser et al. 1993)。
{"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}
Pub Date : 2004-01-01DOI: 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}
Pub Date : 2004-01-01DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：