By Topic

Fast codes for large alphabet sources and its application to block encoding

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

2 Author(s)
B. Ryabkot ; Siberian State Univ. of Telecommun. & Comput. Sci., Tomsk, Russia ; J. Astola

For many adaptive codes the speed of coding depends substantially on the alphabet size. In this paper we suggest a method for speeding up codes based on the following main idea. Letters of the alphabet are put in order according to their probabilities (or frequencies of occurrence), and the letters with probabilities close to each others are grouped in subsets (as new super letters), which contain letters with small probabilities. Such a grouping can increase the redundancy of the code. The suggested algorithm is applied to block coding. In order to surmount the block coding problem we suggest applying the described method of grouping to the set of all possible blocks in such a way that the redundancy caused by grouping is relatively small whereas the size of new alphabet is much less than the number of the possible blocks.

Published in:

Data Compression Conference, 2004. Proceedings. DCC 2004

Date of Conference:

23-25 March 2004