Robust prefix encoding using lower (2,3) number representation

DOI10.1007/S10559-014-9604-XzbMATH Open1342.94062OpenAlexW2066530944MaRDI QIDQ2263249FDOQ2263249

Authors: I. A. Zavadsky, Anatoly V. Anisimov 

Publication date: 18 March 2015

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

Full work available at URL: https://doi.org/10.1007/s10559-014-9604-x

Recommendations

• Compressing prefix code by the means of low \((2,3)\)-representation of numbers
• Prefix Encoding by Means of the $(2,3)$-Representation of Numbers
• Efficient and Compact Representations of Prefix Codes
• Fixed-prefix encoding of the integers can be Huffman-optimal
• The low (2,3)-encoding with error-detecting properties
• Fast and Compact Prefix Codes
• Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systems
• Pre-Encoded Multipliers Based on Non-Redundant Radix-4 Signed-Digit Encoding
• Efficient and compact representations of some non-canonical prefix-free codes
• Efficient and compact representations of some non-canonical prefix-free codes

zbMATH Keywords

error correctionprefix codeerror-correction encoding

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

Cites Work

• Universal codeword sets and representations of the integers
• Integer representation in the mixed base \((2,3)\)
• Prefix Encoding by Means of the $(2,3)$-Representation of Numbers
• Two-base numeration systems

Cited In (3)

• Generating \((2,3)\)-codes
• Variable-length error-correcting codes based on finite automata
• A method for decoding a variable-rate error-correcting code based on finite-state automata

This page was built for publication: Robust prefix encoding using lower \((2,3)\) number representation

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