Delta compression with fixed-length substring coding for fast content download

Delta compression algorithms take advantage of the statistical correlations between different files or packets so that common sequences between two files can be encoded using a copy reference. Delta compression forms the core of fast and efficient content download. We present for the first time, a theoretical framework for delta compression based on information theory and Markov models, including insights into the compression bounds. We also simulated and implemented a generic delta compression scheme and demonstrated its realtime and non realtime performance by applying the scheme on binary data.