We consider the issue of direct access to any letter of a sequence encoded with a variable length code and stored in the computer's memory, which is a special case of the random access problem to compressed memory. The characteristics according to which methods are evaluated are the access time to one letter and the memory used. The proposed methods, with various trade-offs between the characteristics, outperform the known ones.

翻译：我们认为直接接触以可变长度代码编码并存储在计算机内存的序列的任何字母的问题,这是随机访问压缩内存问题的一个特例,评估方法的特征是使用一个字母的存取时间和使用的内存。提议的方法,在各种特性之间取舍,优于已知的方法。