Compression algorithm based on half-length of the binary stream

Yao Chen · Journal of Computer Applications · 2011

A new compression algorithm of binary code was proposed.The black and white run-lengths in the binary code stream were compressed halved,which could also be progressed by selecting different initial length according to different length distribution.The numerical experiments show that the algorithm has a better compression efficiency than that of the traditional method of run-length code,and has good application value.

Read the paper · More papers on PaperTik