Fibonacci Coding Within the Burrows-Wheeler Compression Scheme
Burrows-Wheeler data compression algorithm (BWA) is one of the most effective textual data compressors. BWA includes three main iterations: Burrows-Wheeler transform (BWT), Move-To-Front transformation (MTF) and some zeroth order entropy encoder (e.g. Huffman). The paper discusses little investigated scheme when MTF is replaced by the less popular Distance Coding (DC). Some relevant advantages and downsides of such modified scheme are indicated, the most critical being heavy DC output alphabet. It is shown that applying Fibonacci Code instead of entropy encoder elegantly deals with this technical problem. The results we obtain on the Canterbury Corpus text files are very close to the theoretical lower bounds. Our compressor outperforms the most widely used commercial zip archiver and achieves sophisticated BWA implementation bzip2 compression. Ill. 11, bibl. 14, tabl. 1 (in English; abstracts in English, Russian and Lithuanian).
How to Cite
The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.
By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.