Practical fixed length Lempel-Ziv coding
From MaRDI portal
Publication:496549
DOI10.1016/J.DAM.2013.08.022zbMATH Open1358.68344OpenAlexW1972990908MaRDI QIDQ496549FDOQ496549
Authors: Shmuel T. Klein, Dana Shapira
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.022
Recommendations
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Cites Work
- Compression of individual sequences via variable-rate coding
- A universal algorithm for sequential data compression
- Title not available (Why is that?)
- \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
- Data compression via textual substitution
- Pattern matching in Huffman encoded texts
- Evaluation of parallel text alignment systems -- the ARCADE project
- Parallel Huffman Decoding with Applications to JPEG Files
- Let sleeping files lie: Pattern matching in Z-compressed files.
Cited In (2)
This page was built for publication: Practical fixed length Lempel-Ziv coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496549)