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

📝 Original Info

• Title: Study On Universal Lossless Data Compression by using Context Dependence Multilevel Pattern Matching Grammar Transform
• ArXiv ID: 1303.4854
• Date: 2013-03-21
• Authors: Researchers from original ArXiv paper

📝 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.

💡 Deep Analysis

Deep Dive into Study On Universal Lossless Data Compression by using Context Dependence Multilevel Pattern Matching Grammar Transform.

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.

📄 Full Content

Reference