Interval-based approach to lexicographic representation and compression of numeric data
From MaRDI portal
Publication:4031373
DOI10.1016/0169-023X(92)90046-EzbMATH Open0794.68046MaRDI QIDQ4031373FDOQ4031373
Publication date: 1 April 1993
Published in: Data & Knowledge Engineering (Search for Journal in Brave)
Recommendations
- On the lexicographical generation of compressed codes
- Construction of efficient literal codes for vocabulary methods of data compression
- Compressed representations of sequences and full-text indexes
- Compressing prefix code by the means of low \((2,3)\)-representation of numbers
- New compression schemes for natural number sequences
- On compressing and indexing repetitive sequences
- A lossless compression algorithm for integer difference sequences by optimization of their division into intervals of constant bit depth values
- Relative Lempel-Ziv Compression of Suffix Arrays
- Data compression and information retrieval via symbolization
data compressionfile structuresfloating pointnumeric dataencoding numbersvariable-length byte-strings
This page was built for publication: Interval-based approach to lexicographic representation and compression of numeric data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031373)
