RWTH Aachen University
There are two main classes of algorithms employed in the data compression. The first class of algorithms deals directly with the compression and their purpose is to decrease the size of the input message. Context transformation is a process that turns input data into one with lower zero order entropy. The main weakness of algorithms presented so far is the complexity of replacing procedure. In this paper, the authors describe properties related to the parallelization of replacing procedure and they propose a modified version of a basic context transformation algorithm that uses a parallel approach.