By Topic

A fast symbol coding scheme with specific application in bulk compression

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)
Palau, A. ; Dept. of Electr. & Comput. Eng., Vermont Univ., Burlington, VT, USA ; Mirchandani, G.

Summary form only given. Given a source alphabet of M symbols and associated probabilities or their estimates, we find a sub-optimal set of codewords using a simple prefix property type iterative algorithm to generate codewords lengths and a look-up table based mapping algorithm for assigning codewords. The expected codeword length Lf is slightly longer than that obtained for a Huffman code but may also be equal to it. When it is equal, the algorithm generates a larger set of applicable codewords. The time complexity for generating lengths and the associated codewords is less than that with the Huffman code, where these tasks have a complexity of O(M log M), while they are of order O(M) in the new algorithm. For bulk compression, where it is necessary to compress a large number of small files, the algorithm typically shows greater compression efficiency than that obtained with other standard UNIX based compressors

Published in:

Data Compression Conference, 1998. DCC '98. Proceedings

Date of Conference:

30 Mar-1 Apr 1998