Data coding by linear forms of numerical sequences

DOI10.1023/B:CASA.0000012084.26760.62MaRDI QIDQ557406zbMATH OpenOpenAlexFDO

Authors Anatoly V. Anisimov

Publication date 30 June 2005

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:casa.0000012084.26760.62

zbMATH Keywords

data compressioncoding of treesdata codinglinear Fibonacci formslinear integer formsprefix codes of natural numbers

Mathematics Subject Classification ID

Source coding (94A29) Special sequences and polynomials (11B83) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Encoding trees by linear recurrence sequences
• Linear time tree codes
• A new recursive universal code of the positive integers
• A New Coding Algorithm for Trees
• scientific article; zbMATH DE number 4093555

Cited in

(6)

• Morse Description and Morphological Encoding of Continuous Data
• scientific article; zbMATH DE number 4203702 (Why is no real title available?)
• Binary codes for locally homogeneous sequences
• scientific article; zbMATH DE number 7297813 (Why is no real title available?)
• Generating \((2,3)\)-codes
• Integer representation in the mixed base \((2,3)\)

This page was built for publication: Data coding by linear forms of numerical sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557406)