Fibonacci Coding Within the Burrows-Wheeler Compression Scheme

摘要

Burrows-Wheeler algorithm (BWA for short) is a lossless data compression scheme, named after authors Michael Burrows and David Wheeler. The classical work here is [1]. Also known as block-sorting, currently it is among the best textual data archivers in terms of compression speed and ratio. In this work we describe our BWA based data compressor implementation working principles and compare it with some other popular file archivers. As for prerequisites, the reader is expected to be familiar with basic lossless data compression techniques.