Reducing coding redundancy in LZW

DOI10.1016/J.INS.2005.03.007MaRDI QIDQ2489240zbMATH OpenOpenAlexFDO

Authors G. D. Lakhani

Publication date 16 May 2006

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2005.03.007

zbMATH Keywords

text compression algorithm

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Nonnumerical algorithms (68W05)

Recommendations

• Improved redundancy of a version of the Lempel-Ziv algorithm
• scientific article; zbMATH DE number 975330
• Redundancy of the Lempel-Ziv string matching code
• Redundancy of the Lempel-Ziv incremental parsing rule
• Redundancy estimates for the Lempel–Ziv algorithm of data compression

Cites work

• scientific article; zbMATH DE number 1792105 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Redundancy of the Lempel-Ziv incremental parsing rule
• The effect of flexible parsing for dynamic dictionary-based data compression

Cited in

(4)

• Redundancy elimination for LF
• Making the Long Code Shorter
• LLL reducing with the most significant bits
• A fast dynamic compression scheme for natural language texts

This page was built for publication: Reducing coding redundancy in LZW

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