Referenced Items are not available for this document.
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the marginal distribution, namely exponentially decreasing envelope classes with exponent . The minimax redundancy of exponentially decreasing envelope classes is proved to be equivalent to . Then, an adaptive algorithm is proposed, whose maximum redundancy is equivalent to the minimax redundancy.
Published in:
Information Theory, IEEE Transactions on
(Volume:57
,
Issue:
3
)
Date of Publication: March 2011
- Page(s):
- 1466 - 1478
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 11832443
- Digital Object Identifier :
- 10.1109/TIT.2010.2103831
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 17 February 2011
- Issue Date :
- March 2011
- 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.
