Dr. Dobb's Journal
The data compression book (2nd ed.)
The data compression book (2nd ed.)
Introduction to Digital Systems
Introduction to Digital Systems
Word-Based Compression Methods and Indexing for Text Retrieval Systems
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
A Corpus for the Evaluation of Lossless Compression Algorithms
DCC '97 Proceedings of the Conference on Data Compression
Compression of Small Text Files using Syllables
DCC '06 Proceedings of the Data Compression Conference
Comparison of Text Models for BWT
DCC '07 Proceedings of the 2007 Data Compression Conference
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
IEEE Transactions on Information Theory
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
Analysis of parallelization effects on textual data compression
ICAI'10 Proceedings of the 11th WSEAS international conference on Automation & information
Textual data compression speedup by parallelization
WSEAS Transactions on Computers
| Hi-index | 0.00 |
This paper suggests a novel compression scheme for small text files. The proposed scheme depends on Boolean minimization of binary data accompanied with the adoption of Burrows-Wheeler transformation (BWT) algorithm. Compression of small text files must fulfil special requirements since they have small context. The use of Boolean minimization and Burrows-Wheeler transformation generate better context information for compression with standard algorithms. We tested the suggested scheme on collections of small and medium-sized files. The testing results showed that proposed scheme improve the compression ratio over other existing methods.