### Abstract

This paper advances a new lossless data compression method utilizing reversible data hiding to reduce compression times significantly and achieve good compression rates. The core idea of the new approach is to transform a longer binary sequence into a shorter n-ary sequence, transform the n-ary sequence into two binary subsequences, and apply a lossless coding algorithm based on the assumption that a shorter sequence obviously takes less time than a longer sequence. Mathematical conditions to show when the theory proposed in this paper is attainable are provided. The proposed method keeps as good of a compression rate as arithmetic coding, but takes much less time than that. Experiments show that the proposed theory is true.

Original language | English |
---|---|

Title of host publication | Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010 |

Pages | 419-423 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2010 |

Event | 12th International Asia Pacific Web Conference, APWeb 2010 - Busan, Korea, Republic of Duration: 2010 Apr 6 → 2010 Apr 8 |

### Publication series

Name | Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010 |
---|

### Other

Other | 12th International Asia Pacific Web Conference, APWeb 2010 |
---|---|

Country | Korea, Republic of |

City | Busan |

Period | 10/4/6 → 10/4/8 |

### ASJC Scopus subject areas

- Computer Networks and Communications
- Computer Science Applications

## Fingerprint Dive into the research topics of 'A fast implementation of arithmetic coding'. Together they form a unique fingerprint.

## Cite this

*Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010*(pp. 419-423). [5474097] (Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010). https://doi.org/10.1109/APWeb.2010.76