Data Compression Using Dynamic Markov Modelling
Author(s) -
Gordon V. Cormack,
R. Nigel Horspool
Publication year - 1987
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/30.6.541
Subject(s) - computer science , markov chain , data compression , markov model , adaptive coding , compression (physics) , markov process , arithmetic coding , coding (social sciences) , binary data , algorithm , binary number , variable order markov model , lossless compression , data mining , context adaptive binary arithmetic coding , machine learning , mathematics , statistics , arithmetic , materials science , composite material
A method,to dynamically,construct Markov models,that describe the characteristics of binary messages,is developed. Such models can be used to predict future message,char- acters and can therefore be used as a basis for data compression. To this end, the Mar- kov modelling technique is combined,with Guazzo coding to produce a powerful method of data compression. The method,has the advantage of being adaptive: messages may be encoded,or decoded,with just a single pass through the data. Experimental results re- ported here indicate that the Markov modelling approach generally achieves much,better data compression,than that observed with competing,methods,on typical computer data. Categories and Subject Descriptors: E.4 [Coding and Information Theory]: data com- paction and compression; C.2.0 [Computer-Communication Networks]: data com- munications General Terms: Experimentation, Algorithms Additional Key Words and Phrases: Data compression, text compression, adaptive cod-
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom