Data compression with factor automata

DOI10.1016/0304-3975(92)90144-5MaRDI QIDQ1190467zbMATH OpenOpenAlexWikidataFDO

Authors Marc Zipstein

Publication date 26 September 1992

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(92)90144-5

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Parallel algorithms in computer science (68W10) Theory of data (68P99)

Recommendations

• Compror: On-line lossless data compression with a factor oracle.
• Compression and entropy
• scientific article; zbMATH DE number 4045113
• Lempel-Ziv factorization using less time \& space
• Lempel-Ziv factorization: simple, fast, practical

Cites work

• A Mathematical Theory of Communication
• A Method for the Construction of Minimum-Redundancy Codes
• Compression of individual sequences via variable-rate coding
• Linear Algorithm for Data Compression via String Matching
• On the Complexity of Finite Sequences
• The smallest automaton recognizing the subwords of a text
• Transducers and repetitions

Cited in

(8)

• Application of the Zipf law to text compression
• Compression and entropy
• Compror: On-line lossless data compression with a factor oracle.
• Practical and flexible pattern matching over Ziv-Lempel compressed text.
• scientific article; zbMATH DE number 4045113 (Why is no real title available?)
• A note on the DMC data compression scheme
• scientific article; zbMATH DE number 1773096 (Why is no real title available?)
• scientific article; zbMATH DE number 1775629 (Why is no real title available?)

This page was built for publication: Data compression with factor automata

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