By Topic

A new approach to adaptive encoding data using self-organizing data structures

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)
Rueda, L. ; Univ. of Concepcion, Concepcion ; Oommen, B.J.

This paper demonstrates how techniques applicable for defining and maintaining a special case of binary search trees (BSTs) can be incorporated into "traditional" compression techniques to yield enhanced superior schemes. We, specifically, demonstrate that the newly introduced data structure, the Fano Binary Search Tree (FBST) can be maintained adaptively and in a self-organizing manner. The correctness and properties of the encoding and decoding procedures that update the FBST are included. We also include the theoretical and empirical analysis, which shows that the number of shift operators is large for small files, and it tends to decrease (asymptotically towards zero) for large files.

Published in:

Computer and information sciences, 2007. iscis 2007. 22nd international symposium on

Date of Conference:

7-9 Nov. 2007