Study On Universal Lossless Data Compression by using Context Dependence Multilevel Pattern Matching Grammar Transform
Discrete Mathematics
2013-03-21 v1 Information Theory
math.IT
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.
Cite
@article{arxiv.1303.4854,
title = {Study On Universal Lossless Data Compression by using Context Dependence Multilevel Pattern Matching Grammar Transform},
author = {Chung-Song Kim and Chol-Hun Kim},
journal= {arXiv preprint arXiv:1303.4854},
year = {2013}
}
Comments
5 pages, presented in International Symposium in Commemoration of the 65th Anniversary of the Foundation of Kim Il Sung University (Mathematics), 20-21. Sep. Juche100(2011) Pyongyang DPR Korea