  This paper describes a new method of data encoding which may be used in
various modern digital, computer and telecommunication systems and devices. The
method permits the compression of data for storage or transmission, allowing
the exact original data to be reconstructed without any loss of content. The
method is characterized by the simplicity of implementation, as well as high
speed and compression ratio. The method is based on a unique scheme of
binary-ternary prefix-free encoding of characters of the original data. This
scheme does not require the transmission of the code tables from encoder to
decoder; allows for the linear presentation of the code lists; permits the
usage of computable indexes of the prefix codes in a linear list for decoding;
makes it possible to estimate the compression ratio prior to encoding; makes
the usage of multiplication and division operations, as well as operations with
the floating point unnecessary; proves to be effective for static as well as
adaptive coding; applicable to character sets of any size; allows for repeated
compression to improve the ratio.
