By Topic

Asymptotically optimal low complexity sequential lossless coding for regular piecewise stationary memoryless 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
$33 $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

3 Author(s)
Gill I. Shamir ; Dept. of Electr. Eng., Notre Dame Univ., IN, USA ; Daniel J. Costello ; N. Merhav

The lower bound on the redundancy for lossless universal coding of regular memoryless sources with abruptly changing statistics is shown to be achievable using a fixed per-letter computational complexity strongly sequential compression scheme with logarithmic storage complexity.

Published in:

Information Theory and Communications Workshop, 1999. Proceedings of the 1999 IEEE

Date of Conference:

25-25 June 1999