A Lossless Bit Isolation Algorithm for Data Compression by Using Static Dictionary

Data compression is the reduction of bit or actual size of data by eliminating the repetition of identical sets of data bits to achieve fewer bits than the primary one. Character encryption is a famous time period of statistics compression that includes an everyday sample of records individual with a few affable encoding formulations. This encoding is a pastime of corresponding encoding approach that encompasses character characters, dolled up with extraordinary sorts of data and emblems. Data compressions expand over a large field of citation including data storage, database technology, and data transmission. In this paper, a statistics compression method denoted as Lossless Bit Isolation (LBI) has been implemented which honestly manifested on a character encoding technique. These isolated characters have found using set, sub-set, and static dictionary. Similarly, for assimilating the outcome of LBI two most well-liked algorithm terms LZW and Huffman are used. The investigational consequences of the counseled approach carry off common compression ratio 0.52 and again talented than LZW and Huffman.