Generating (2,3)-codes

DOI10.1007/S10559-020-00307-9zbMATH Open1496.68139OpenAlexW3108346810MaRDI QIDQ2215868FDOQ2215868

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)

Cites Work

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

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)