Lossless Data Compression Using Optimal Tree Machines

We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at preventing expansion of the encoded string for data whose statistics deviate from those represented by the machines. The resulting algorithm is shown to have superior compression of short files compared to other methods.

• Type: Conference
• Year: 2005
• Where: DCC
• Authors: Gergely Korodi, Jorma Rissanen, Ioan Tabus
• Keywords: Computer Graphics, DCC 2005, Lossless Data Compression, Tree Machines