Practical fixed length Lempel-Ziv coding

DOI10.1016/J.DAM.2013.08.022MaRDI QIDQ496549zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

compressionLempel-Ziv fixed length encoding

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)

Recommendations

• scientific article; zbMATH DE number 1786445
• An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
• Fast and efficient coding of information sources
• On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
• Parallel Lempel Ziv coding

Cites work

• scientific article; zbMATH DE number 1975048 (Why is no real title available?)
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Data compression via textual substitution
• Evaluation of parallel text alignment systems -- the ARCADE project
• Let sleeping files lie: Pattern matching in Z-compressed files.
• Parallel Huffman Decoding with Applications to JPEG Files
• Pattern matching in Huffman encoded texts
• \((s,c)\)-dense coding: an optimized compression code for natural language text databases.

Cited in

(2)

• An efficient variable-to-fixed length encoding using multiplexed parse trees
• scientific article; zbMATH DE number 1786445 (Why is no real title available?)

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)