Interval-based approach to lexicographic representation and compression of numeric data

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1016/0169-023X(92)90046-E" rel="nofollow">DOI 10.1016/0169-023X(92)90046-E</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/0794.68046" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q4031373" rel="nofollow">MaRDI QID Q4031373</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q4031373" rel="nofollow">FDO</a>

Authors Naphtali Rishe

Publication date 1 April 1993

Published in Data & Knowledge Engineering (Search for Journal in Brave)

zbMATH Keywords

data compressionfile structuresfloating pointnumeric dataencoding numbersvariable-length byte-strings

Mathematics Subject Classification ID

Theory of data (68P99)

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

Cited in

(1)

• Binary Coding of Hierarchical Structures

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)