By Topic

Redundancy rates for renewal and other processes

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)
Csiszar, I. ; Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary ; Shields, P.

Upper and lower bounds, both of order √n, are obtained on minimax redundancy of universal lossless codes for the class of renewal processes. This is the first example of an interesting model class with strong redundancy rate o(n) but not O(log n). For the same class, the nonexistence of weak-rate bounds of smaller order than √n is also shown. The methods extend to provide upper and lower redundancy rate bounds of order n(k+1)/(k+2) for the class of processes that are Markov renewal of order k. The weak-rate methods also extend to show the nonexistence of o(n) weak-rate bounds for the class of regenerative processes

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 6 )