  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.
