Data Coding by Linear Forms of Numerical Sequences

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.

Previous Menu Next

Abstract

This paper proposes to code integers and binary trees by linear forms of (au_{n-1}+bu_{n})-type, where u_{n-1} and u_{n-1} 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.