On high performance VF coding allowing fast and and sophisticated pattern matching

在这项研究中，申请人解决了改进可变长度到固定长度代码（VF代码）的问题。VF代码是一种使用固定长度代码的编码方案，它提供了对压缩数据的轻松访问。然而，与变长码相比，传统的VF码通常具有较差的压缩比。申请人等人提出了一种新的VF编码方法，将固定长度的编码应用于使用Larsson和Moffat于1999年提出的Re-Pair算法提取的一组规则。Re-Pair算法是一种简单的离线基于语法的压缩方法，在压缩速度适中的情况下具有良好的压缩比性能。该方法被命名为Re-Pair-VF编码。实验结果表明，Re-Pair-VF编码方法优于现有的VF编码方法。

In this study, the applicant addressed the problem of improving variable-length-to-fixed-length codes (VF codes). A VF code is an encoding scheme that uses a fixed-length code, which provides easy access to compressed data. However, conventional VF codes generally have an inferior compression ratio compared with variable-length codes. The applicant et al. proposed a new VF coding method that applies a fixed-length code to a set of rules extracted using the Re-Pair algorithm, which was proposed by Larsson and Moffat in 1999. The Re-Pair algorithm is a simple offline grammar-based compression method, which has good compression-ratio performance with moderate compression speed. The proposed method is named as Re-Pair-VF coding. The experimental results showed that Re-Pair-VF coding is superior to the existing VF coding method.