Abstract: Abstract: In this article, a new compression Algorithm based on Inter-Relevant Successive Trees (IRST) is proposed. This compression Algorithm uses IRST to find the longest string that appears before and then replaces the longest string with a code. For this good attribute over LZW, it has a better compression rate than LZW.

Key words: Text Compression, Inter-Relevant Successive Trees, LZW

摘要： 摘 要: 本文主要提出了使用互关联后继树来实现文本压缩的方法。利用互关联后继树的检索功能可以方便地查找最长匹配串，从而达到更好的文本压缩效果。从试验结果上来看，这种方法压缩率高于LZW,有好的实用性。

关键词: 文本压缩, 互关联后继树, LZW