By Topic

Coding combinatorial sources with costs

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)
Suzuki, J. ; Dept. of Math., Osaka Univ., Japan ; Ryabko, B.

We consider coding infinite sequences of a finite alphabet. The source is defined as a set of sequences (combinatorial source). The problem is to minimize the worst asymptotic compression ratio between each sequence and its coding output among the sequences in the combinatorial source. Ryabko showed that the optimal value coincides with the Hausdorff dimension of the combinatorial source. This correspondence extends the previous work in that the input and output costs are expressed in terms of not lengths but generalized costs. The essential quantity turns out to be the Hausdorff dimension with respect to the measure associated with the input cost. We construct an asymptotically optimal coding procedure, and also show that no coding scheme can beat the lower bound.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 5 )