Non-Linear Data Structure for Data Coding for Size Compression

Abstract

Data compression is a special case of communication system which is a basic problem in engineering and computer science. In this work, the new scheme has been introduced for data coding to compress the size. Compression by using one type of Non-linear Data-Structure which is Prefix Binary Tree data compression is essential and beneficial in the diversity of application which is embraced in general into two branches: the storage and transmission.the storage of a file in a compressed form takes fewer bit than in uncompressed form, therefore make the most of storage resources (containing main memory itself), and by transmission means sending the files over a channel with reduced number of bits by compression process. This leads to more efficacious transmission process. The compression process of stored data or that to be transmitted leads to significantly reducing both of the storage and transmission. We use text type as a data in the experiments. The results show the compression rate is reduce the actual size above 50%.