Compression of small text files

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.