scientific article; zbMATH DE number 1285526

MaRDI QIDQ4242277zbMATH OpenFDO

Authors M. P. Sharova

Publication date 10 May 1999

zbMATH Keywords

data compressionredundancyMarkov sourcelow entropy

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Information storage and retrieval of data (68P20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Source coding (94A29)

Recommendations

• Fast coding of low-entropy sources
• Fast encoding of low-entropy sources
• Coding low-entropy Markov sources with unknown statistics
• scientific article; zbMATH DE number 1285527
• Noiseless coding of binary finite-order Markov sources (Corresp.)
• Entropy preservation under Markov coding.
• Universal coding algorithm for a family of context Markov sources
• scientific article; zbMATH DE number 5941301
• Variable to fixed-length codes for Markov sources
• On asymptotically optimal methods of prediction and adaptive coding for Markov sources

Cited in

(13)

• scientific article; zbMATH DE number 6460053 (Why is no real title available?)
• Fast coding of low-entropy sources
• Noiseless coding of binary finite-order Markov sources (Corresp.)
• Fast and efficient coding of information sources
• On asymptotically optimal methods of prediction and adaptive coding for Markov sources
• Entropy preservation under Markov coding.
• Über die implementierung redundanzfreier Codes zur datenverschlüsselung
• Data Compression for a Source with Markov Characteristics
• Asymptotic Redundancy of the MTF Scheme for Stationary Ergodic Sources
• Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models
• Symbol-Based Modeling and Coding of Block Markov Sources
• Fast encoding of low-entropy sources
• Source matching problems revisited

This page was built for publication:

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