Generating (2,3)-codes

DOI10.1007/S10559-020-00307-9MaRDI QIDQ2215868zbMATH OpenOpenAlexFDO

Authors Anatoly V. Anisimov

Publication date 14 December 2020

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

Full work available at URL https://doi.org/10.1007/s10559-020-00307-9

zbMATH Keywords

numeration systeminteger encodingradixprefix encoding

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Integer representation in the mixed base \((2,3)\)
• The low (2,3)-encoding with error-detecting properties
• Compressing prefix code by the means of low \((2,3)\)-representation of numbers
• Robust prefix encoding using lower \((2,3)\) number representation
• Data coding by linear forms of numerical sequences

Cites work

• scientific article; zbMATH DE number 3326139 (Why is no real title available?)
• Estimating the size of correcting codes using extremal graph problems
• Prefix Encoding by Means of the $(2,3)$-Representation of Numbers
• Robust prefix encoding using lower \((2,3)\) number representation
• Robust transmission of unbounded strings using Fibonacci representations
• The use and usefulness of numeration systems
• Two-base numeration systems
• Universal codeword sets and representations of the integers

Cited in

(2)

• The low (2,3)-encoding with error-detecting properties
• Compressing prefix code by the means of low \((2,3)\)-representation of numbers

This page was built for publication: Generating \((2,3)\)-codes

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