IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Journals & Magazines > Information Theory, IEEE Tran ...> Volume:48 Issue:9 Help

On the performance of recency-rank and block-sorting universal lossless data compression algorithms

Full Text Sign-In or Purchase

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

1 Author(s)
Muramatsu, J. ; NTT Commun. Sci. Labs., NTT Corp., Kyoto, Japan

Bounds on the redundancy of the recency-rank and block-sorting universal lossless data compression algorithms for finite-length sequences are presented. These algorithms are asymptotically optimal for infinite-length sequences, stationary ergodic sources in the almost-sure sense, and asymptotically mean stationary sources in the average and almost-sure sense

Published in:
Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 9 )

Date of Publication: Sep 2002

Page(s):
2621 - 2625
ISSN :
0018-9448
INSPEC Accession Number:
7377123
Digital Object Identifier :
10.1109/TIT.2002.801477
Product Type:
Journals & Magazines
Date of Current Version :
07 November 2002
Issue Date :
Sep 2002
Sponsored by :
IEEE Information Theory Society

IEEE Account

Purchase Details

Profile Information

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.