The Burrows-Wheeler Transform is a well known transformation widely used in Data Compression: important competitive compression software, such as Bzip (cf. ) and Szip (cf. ) and some indexing software, like the FM-index (cf. ), are deeply based on the Burrows Wheeler Transform. The main advantage of using BWT for data compression consists in its feature of "clustering" together equal characters. In this paper we show the existence of fixed points of BWT, i.e., words on which BWT has no effect. We show a characterization of the permutations associated to BWT of fixed points and we give the explicit form of fixed points on a binary ordered alphabet a, b having at most four b's and those having at most four a's.
|Numero di pagine||12|
|Stato di pubblicazione||Published - 2017|
All Science Journal Classification (ASJC) codes