2008
DOI: 10.1002/dac.943
|View full text |Cite
|
Sign up to set email alerts
|

An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees

Abstract: SUMMARYIn this paper, we demonstrate that we can effectively use the results from the field of adaptive selforganizing data structures in enhancing compression schemes. Unlike adaptive lists, which have already been used in compression, to the best of our knowledge, adaptive self-organizing trees have not been used in this regard. To achieve this, we introduce a new data structure, the partitioning binary search tree (PBST) which, although based on the well-known binary search tree (BST), also appropriately pa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2009
2009

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 37 publications
0
1
0
Order By: Relevance
“…The rest of this chapter is based on joint work with Nekrich [GN] that shows how, on a RAM with Ω(log n)-bit words, we can speed up our algorithm even more, to both encode and decode in O(1) worst-case time. We note that Rueda and Oommen [RO04, RO06,RO08] have demonstrated the practicality of certain implementations of adaptive Fano coding, which is somewhat related to our algorithm ,especially a version [Gag04] in which we maintained an explicit code-tree.…”
Section: Chapter 2 Adaptive Prefix Codingmentioning
confidence: 91%
“…The rest of this chapter is based on joint work with Nekrich [GN] that shows how, on a RAM with Ω(log n)-bit words, we can speed up our algorithm even more, to both encode and decode in O(1) worst-case time. We note that Rueda and Oommen [RO04, RO06,RO08] have demonstrated the practicality of certain implementations of adaptive Fano coding, which is somewhat related to our algorithm ,especially a version [Gag04] in which we maintained an explicit code-tree.…”
Section: Chapter 2 Adaptive Prefix Codingmentioning
confidence: 91%