Quote: data compression in O(kn) time and O(n) space by Burrows-Wheeler Transformation; groups same right context together; fast and efficient

Quotation Skeleton

A very interesting recent development is data compression … [DEC SRC #124 1994]. The idea is to permute the input sequence in such … [the same right context] are grouped together. We provide a thorough analysis of the … [p. 1043] We have developed a data compression program … runs in O(kn) time and requires O(n) space, … results show that it achieves a better compression … [ref] and the Canterbury Corpus [ref]. It also showed the best … For the former corpus, the gzip-program [ref] compresses 2.4 times faster than our program. For the latter …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: data compression algorithms (53 items)