Cart (Loading....) | Create Account
Close category search window

Block source coding theory for asymptotically mean stationary sources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Several properties of operational and information theoretic distortion rate functions and of mutual information rate are developed for asymptotically mean stationary (ams) processes with standard alphabets and used to prove a block source coding theorem for ergodic ams sources. In the development we prove an ergodic decomposition of the mutual information rate of ams sources, we show that the operational distortion rate function of an ams source equals that of its stationary mean, and we provide a new and direct proof of the equality of the ergodic and stationary process distortion rate functions. The latter result yields a proof of the block source coding theorem not requiring the Nedoma decomposition and complicated code construction used by Gallager and Berger.

Published in:

Information Theory, IEEE Transactions on  (Volume:30 ,  Issue: 1 )

Date of Publication:

Jan 1984

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.