Study On Universal Lossless Data Compression by using Context Dependence Multilevel Pattern Matching Grammar Transform

TL;DR

This paper introduces the CDMPM grammar transform for universal lossless data compression, providing a new algorithm with a proven upper bound on worst-case redundancy for sequences over finite alphabets.

Contribution

The paper proposes the CDMPM grammar transform and develops a universal lossless compression algorithm with a theoretical redundancy bound.

Findings

Developed the CDMPM grammar transform for data compression

Created the CDMPM coding algorithm based on the transform

Established an upper bound on worst-case redundancy

Abstract

In this paper, the context dependence multilevel pattern matching(in short CDMPM) grammar transform is proposed; based on this grammar transform, the universal lossless data compression algorithm, CDMPM code is then developed. Moreover we get a upper bound of this algorithms' worst case redundancy among all individual sequences of length n from a finite alphabet.