Referenced Items are not available for this document.
We study the strong law of large numbers and the Shannon-McMillan theorem for Markov chain fields on trees. First, we prove the strong law of large numbers for the frequencies of occurrence of states and ordered couples of states for Markov chain fields on trees. Then, we prove the Shannon-McMillan theorem with almost everywhere (a.e.) convergence for Markov chain fields on trees. We prove the results on a Bethe tree and then just state the analogous results on a rooted Cayley tree. In the proof, a new technique for establishing the strong limit theorem in probability theory is applied
Published in:
Information Theory, IEEE Transactions on
(Volume:48
,
Issue:
1
)
Date of Publication: Jan 2002
- Page(s):
- 313 - 318
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 7157553
- Digital Object Identifier :
- 10.1109/18.971762
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 07 August 2002
- Issue Date :
- Jan 2002
- Sponsored by :
- IEEE Information Theory Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
