One attempt of a compression algorithm using the BWT. It includes some interesting aspects for the RLE field too. An important property of the output of the BWT is the presents of many runs, which results in overestimating the probability of symbols outside the run. Besides that, a modification of the MTF algorithm is described which moves the next symbol to the second place in the list instead of the first place, except the old position of the new symbol was 0 or 1. If the old position of the new symbol was 1 it is moved to the first place only if the last output number was different from 0. This paper is my favourite paper from Bernhard.
RLE is a very simple form of data compression that deflates repeated elements in a sequence. So I looked around on the internet. One shortcoming of many implementations was that they exclusively work on strings that must not contain any digit. How many texts do you know that contain many repeated more than 2 characters? So string compression is hardly a good use case for RLE.
Run-length encoding RLE is a form of lossless data compression in which runs of data sequences in which the same data value occurs in many consecutive data elements are stored as a single data value and count, rather than as the original run. This is most useful on data that contains many such runs. It is not useful with files that don't have many runs as it could greatly increase the file size.
30.09.2019 16:42:56 Jubei:
Dear lord her voice is annoying
01.10.2019 19:50:20 Shasida:
Did you ever hear the tragedy of Darth Plagueis the wise?