

Author: Anisimov A. V.
Publisher: Springer Publishing Company
ISSN: 1060-0396
Source: Cybernetics and Systems Analysis, Vol.39, Iss.5, 2003-09, pp. : 633-643
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
This paper proposes to code integers and binary trees by linear forms of -type, where
and
are adjacent members of some integer sequence. New prefix codes of integers are obtained. Such codes have better characteristics than the well-known Levenshtein code. Data compression by means of coding by linear forms is considered. Linear Fibonacci forms are studied in detail.
Related content


On the relationships of seven numerical sequences
By Leindler L.
Acta Mathematica Hungarica, Vol. 114, Iss. 3, 2007-03 ,pp. :


Electric transport and coding sequences of DNA molecules
PHYSICA STATUS SOLIDI (B) BASIC SOLID STATE PHYSICS, Vol. 243, Iss. 2, 2006-02 ,pp. :


Independence of linear forms with random coefficients
Probability Theory and Related Fields, Vol. 137, Iss. 1-2, 2007-01 ,pp. :


Non‐linear Transformations of Divergent and Slowly Convergent Sequences
STUDIES IN APPLIED MATHEMATICS, Vol. 34, Iss. 1, 1955-04 ,pp. :