ISSDC: Digram Coding Based Lossless Data Compression Algorithm
Altan Mesut ; Aydin Carus
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
In this paper, a new lossless data compression method that is based on digram coding is introduced. This data compression method uses semi-static dictionaries: All of the used characters and most frequently used two character blocks (digrams) in the source are found and inserted into a dictionary in the first pass, compression is performed in the second pass. This two-pass structure is repeated several times and in every iteration particular number of elements is inserted in the dictionary until the dictionary is filled. This algorithm (ISSDC: Iterative Semi-Static Digram Coding) also includes some mechanisms that can decide about total number of iterations and dictionary size whenever these values are not given by the user. Our experiments show that ISSDC is better than LZW/GIF and BPE in compression ratio. It is worse than DEFLATE in compression of text and binary data, but better than PNG (which uses DEFLATE compression) in lossless compression of simple images.
Publié le : 2012-01-26
Classification:  Lossless data compression; dictionary-based compression; semi-static dictionary; digram coding
@article{cai111,
     author = {Altan Mesut and Aydin Carus},
     title = {ISSDC: Digram Coding Based Lossless Data Compression Algorithm},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai111}
}
Altan Mesut; Aydin Carus. ISSDC: Digram Coding Based Lossless Data Compression Algorithm. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai111/