Robust prefix encoding using lower (2,3) number representation
From MaRDI portal
Publication:2263249
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
Cites work
Cited in
(5)- Generating (2,3)-codes
- Variable-length error-correcting codes based on finite automata
- The low (2,3)-encoding with error-detecting properties
- Compressing prefix code by the means of low \((2,3)\)-representation of numbers
- 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)