A lossless compression algorithm for integer difference sequences by optimization of their division into intervals of constant bit depth values

MaRDI QIDQ3450136zbMATH OpenFDO

Authors Alekseĭ E. Khmel'Nov

Publication date 2 November 2015

zbMATH Keywords

dynamic programminglossless compressionspecialized data compression algorithm

Mathematics Subject Classification ID

Dynamic programming (90C39) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Compactly encoding unstructured inputs with differential compression
• Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
• An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
• Fast gapped variants for Lempel-Ziv-Welch compression
• A universal algorithm for sequential data compression

Cited in

(4)

• Compactly encoding unstructured inputs with differential compression
• \textsc{Stream VByte}: faster byte-oriented integer compression
• Interval-based approach to lexicographic representation and compression of numeric data
• Content-dependent chunking for differential compression, the local maximum approach

This page was built for publication: A lossless compression algorithm for integer difference sequences by optimization of their division into intervals of constant bit depth values

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