Data Coding by Linear Forms of Numerical Sequences

Authors:
A. V. Anisimov
Affiliations:
Taras Shevchenko University, Kiev, Ukraine ava@mi.unicyb.kiev.ua
Venue:
Cybernetics and Systems Analysis
Year:
2003

Citing 6
Cited 1

Addition machines

SIAM Journal on Computing
Universal Compression and Retrieval

Universal Compression and Retrieval
Linear Fibonacci Forms and Parallel Algorithms for High Dimension Arithmetic

PaCT '95 Proceedings of the 3rd International Conference on Parallel Computing Technologies
Grammar-based codes: a new class of universal lossless source codes

IEEE Transactions on Information Theory
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models

IEEE Transactions on Information Theory
A universal algorithm for sequential data compression

IEEE Transactions on Information Theory

Integer representation in the mixed base (2,3)

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

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.