By Topic

On a class of multilevel universal source coding schemes

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)
Hertz, D. ; Rafael, Haifa, Israel ; Azenkot, Y.

This work seeks to reduce the computational complexity and the coding rate associated with a class of universal source coding schemes for encoding fixed length m-ary sequences into variable length sequences. The Lynch-Davisson (1966) minimax universal source coding scheme, the Tanaka-Ando-Leon-Garcia (TAL) weighted universal source coding scheme (1985), and Cover's general enumerative source coding scheme (1973) are modified. The essence of the proposed modification is to rename the m symbols of the alphabet so that the most frequent symbol of the given input data block will be denoted 0 the second most frequent symbol will be denoted 1, and so on, until the least frequent symbol will be denoted m-1. It is proven that out of all the m permutations of the m symbols, the proposed one minimizes the computational complexity of the above mentioned schemes, and preserves their unique decodability property. Moreover, for the modified TAL scheme it is proven that for block lengths nm further data compression can be achieved

Published in:

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