A New Probability Based Parity Encoding Algorithm for Data Compression
Zheng Gao · Journal of Sichuan University · 2003
A new probability based parity encoding algorithm was presented to meet the compression requirement of certain data that has only sixteen different characters. The algorithm uses a fixed set of complementary parity codes to replace the encoding table that dynamically generated by the traditional Huffman method. This simplified and speeded up the encoding and decoding process, and yet maintained about the same encoding efficiency compare with the dynamic algorithm. The application results of the new approach were satisfied.