Computer Science – Information Theory
Scientific paper
2008-04-15
Computer Science
Information Theory
Submitted to IEEE Transactions on Information Theory, Apr. 2008
Scientific paper
It is demonstrated how to represent asymptotically mean stationary (AMS) random sources with values in standard spaces as mixtures of ergodic AMS sources. This an extension of the well known decomposition of stationary sources which has facilitated the generalization of prominent source coding theorems to arbitrary, not necessarily ergodic, stationary sources. Asymptotic mean stationarity generalizes the definition of stationarity and covers a much larger variety of real-world examples of random sources of practical interest. It is sketched how to obtain source coding and related theorems for arbitrary, not necessarily ergodic, AMS sources, based on the presented ergodic decomposition.
No associations
LandOfFree
The ergodic decomposition of asymptotically mean stationary random sources does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The ergodic decomposition of asymptotically mean stationary random sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The ergodic decomposition of asymptotically mean stationary random sources will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-606655