Data Compression for a Source with Markov Characteristics

DOI10.1093/COMJNL/30.2.149MaRDI QIDQ4721955zbMATH OpenOpenAlexFDO

Authors John A. Llewellyn

Publication date 1987

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/30.2.149

zbMATH Keywords

average code/source ratiodata compressionfinite state modelsoptimum compressionstatistical structure of the source

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 3463524
• Data compression by means of a ``book stack
• Epsilon Entropy and Data Compression
• scientific article; zbMATH DE number 1285526
• scientific article; zbMATH DE number 3700709

Cited in

(5)

• Probability Distance Based Compression of Hidden Markov Models
• Two-dimensional encoding by finite-state encoders
• Asymptotic Redundancy of the MTF Scheme for Stationary Ergodic Sources
• A note on the DMC data compression scheme
• A new model of numerical computer data and its application for construction of minimum-redundancy codes

This page was built for publication: Data Compression for a Source with Markov Characteristics

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