The efficient decoding of multi-delimiter code C₂,3,5.

MaRDI QIDQ5507331zbMATH OpenFDO

Authors I. O. Zavadskï

Publication date 16 December 2016

zbMATH Keywords

compression codesdecodingmulti-delimitertabular method

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60)

Recommendations

• Fast tabular decoding method for multi-delimiter codes
• Fast decoding algorithms for variable-lengths codes
• A memory-efficient and fast Huffman decoding algorithm
• A novel memory-efficient Huffman decoding algorithm and its implementation
• Compressing prefix code by the means of low \((2,3)\)-representation of numbers

Cited in

(2)

• Fast tabular decoding method for multi-delimiter codes
• Dense non-binary Fibonacci codes

This page was built for publication: The efficient decoding of multi-delimiter code \(C_{2,3,5}\).

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