Compressing big data: when the rate of convergence to the entropy matters

DOI10.1007/978-3-319-32859-1_24zbMATH Open1460.68036OpenAlexW2462384620WikidataQ59279122 ScholiaQ59279122MaRDI QIDQ2807846FDOQ2807846

Authors: Salvatore Aronica, Alessio Langiu, Francesca Marzi, Salvatore Mazzola, Filippo Mignosi, Giulio Nazzicone 

Publication date: 25 May 2016

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-32859-1_24

Recommendations

• On optimal parsing for LZ78-like compressors
• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• Bicriteria data compression: efficient and usable
• On the bit-complexity of Lempel-Ziv compression
• On the bit-complexity of Lempel-Ziv compression

zbMATH Keywords

string algorithmstext compressionLempel-Ziv compression algorithmstext entropy

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)

Cited In (1)

• On optimal parsing for LZ78-like compressors

This page was built for publication: Compressing big data: when the rate of convergence to the entropy matters

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