Skip to main content
SpringerLink
Log in

Data Coding by Linear Forms of Numerical Sequences

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

This paper proposes to code integers and binary trees by linear forms of aun-1+bun-type, where un-1 and un-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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, 23, 337-343 (1997).

    Google Scholar 

  2. T. Kieffer and E. Yang, "Grammar-based codes: A new class of universal lossless source codes," IEEE Trans. Inform. Theory, 46, 737-754 (1997).

    Google Scholar 

  3. E. Yang and F. Kieffer, "Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. Part 1. Without context models," IEEE Trans. Inf. Theory, 46, No. 3, 337-343 (2000).

    Google Scholar 

  4. V. I. Levenshtein, "Redundancy and delay of recoverable coding of natural numbers," Probl. Kibern., No. 20, 173-179 (1968).

  5. R. Krichevsky, Universal Compression and Retrieval, Kluwer, Dordrecht-Boston-London (1993).

    Google Scholar 

  6. Yu. V. Matiyasevich, "Enumerable sets are Diophantine," Dokl. Akad. Nauk SSSR, 191, 279-282 (1970).

    Google Scholar 

  7. R. W. Floyd and D. E. Knuth, "Addition machines," SIAM J. Comput., No. 2, 329-340 (1970).

  8. A. V. Anisimov, "Fibonacci hypercube," Intern. J. Comput. Math., 68, 221-229 (1998).

    Google Scholar 

  9. D. Knuth, The Art of Computer Programming [Russian translation], Vols. 1–3, Izdat. Dom "Vil'yams," Moscow (2000).

    Google Scholar 

  10. A. V. Anisimov, Ya. P. Ryndin, and S. Ye. Red'ko, "Inverse Fibonacci transformation," Kibern. Sist. Anal., No. 3, 9-11 (1982).

  11. A. V. Anisimov, "Fibonacci linear forms and parallel arithmetic algorithms for large numbers," Kibern. Sist. Anal., No. 3, 106-115 (1995).

  12. A. V. Anisimov, "Linear Fibonacci forms and parallel algorithms for high dimension arithmetic," Lecture Notes Comput. Sci., 964, 16-20 (1995).

    Google Scholar 

  13. A. V. Anisimov, Algorithmic Theory of Large Numbers [in Ukrainian], Vydavn. Dim "Akademperiodika," Kyiv (2001).

    Google Scholar 

  14. A. V. Anisimov, "Optimal packing of trees," Kibern. Sist. Anal., No. 3, 89-91 (1976).

  15. A. V. Anisimov, I. V. Karpenko, and V. V. Kryzhanovskii, "Representation of ordered trees," Kibern. Sist. Anal., No. 3, 29-34 (1980).

Download references

Author information

Authors and Affiliations

  1. Taras Shevchenko University, Kiev, Ukraine

    A. V. Anisimov

Authors
  1. A. V. Anisimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anisimov, A.V. Data Coding by Linear Forms of Numerical Sequences. Cybernetics and Systems Analysis 39, 633–643 (2003). https://doi.org/10.1023/B:CASA.0000012084.26760.62

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CASA.0000012084.26760.62

Search

Navigation