Abstract
We propose a new sort-based transform for lossless data compression that can replace the BWT transform in the block-sorting data compression algorithm. The proposed transform is a parametric generalization of the BWT and the RadixZip transform proposed by Vo and Manku (VLDB, 2008), which is a rather new variation of the BWT. For a class of parameters, the transform can be performed in time linear in the data length. We give an asymptotic compression bound attained by our algorithm. © 2009 Springer.
Cite
CITATION STYLE
Inagaki, K., Tomizawa, Y., & Yokoo, H. (2009). Novel and generalized sort-based transform for lossless data compression. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5721 LNCS, pp. 102–113). https://doi.org/10.1007/978-3-642-03784-9_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
