A TRANSFORMADA DE BURROWS-WHEELER E SUA APLICAÇÃO À COMPRESSÃO / THE BURROWS-WHEELER TRANSFORM AND ITS APPLICATIONS TO COMPRESSION

AUTOR(ES)
DATA DE PUBLICAÇÃO

2003

RESUMO

The Burrows-Wheeler Transform, based on sorting of contexts, transforms a sequence of characters into a new sequence easier to compress by an algorithm that exploits long sequences of repeted characters. Combined with the coding provided by the MoveToFront Algorithm and followed by a codification for the generated integers, they propose a new family of compressors, that achieve excellent compression rates with good time performances in compression and decompression. This work examines detaildedly this transform, its variations and some alternatives for the algorithms used together with it. As a final result, we present a combination of strategies that producescompression rates for text data that are better than those offered by implementations available nowadays.

ASSUNTO(S)

information theory movetofront data compression moverparafrente compressao de dados burrows-wheeler transform teoria da informacao integer coding transformada de burrows-wheeler codificacao de inteiros

ACESSO AO ARTIGO

Documentos Relacionados