Data Compression And Its Resistance To The Channel Error Performance

These years ,the researches of technology of data compression have received more and more attention with the spring up of technology of multimedia, communication and computer. At the same time, the ability of the applied algorithmic of error resiliency of data compression have become more important, Strong or not of the ability can decide the algorithmic appropriate environment. So, for practical data compression communicate system, to design high-efficiency encoder/decoder and compressed signal for resistible errors, is an attentive problem all the time for researcher.In the article , The author has gone deep into researching the universality theory, capability guideline for technology of loss-less data compression, specially engaged in researching and achieving of Huffman coding, including the achievement of general Huffman coding, considering the achievement of equilibria of 0 ,1 in Huffman coded stream, discussed the problem of resistible errors of Huffman coding, researched the arithmetic of bidirectionally decodable streams; the other emphases of the article is arithmetic coding, researched and achieved the arithmetic coding, discussed the problem of joint loss-less-source and channel coding for error detection and correction of resistible channel errors.In the actual communicate standard of data compression and in the establishment of the new standard, Huffman and arithmetic coding are the most important arithmetic which have been used widely or would be used. To research Huffman and arithmetic coding and to research the ability of resistible errors for practicality, there would be basal reference value for digesting and achieving communicate standard of data compression.