A complete sufficient statistic for finite-state Markov processes with application to source coding

DOI10.1109/18.256512zbMATH Open0785.62003OpenAlexW2111721300MaRDI QIDQ4277166FDOQ4277166

Authors: Laurence B. Wolfe, Chein-I Chang 

Publication date: 13 February 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/05a677e2b69968337b02c2d8120e5a7404cda49a

Recommendations

• Complete sufficient statistics for Markov chains
• Estimating with partial statistics the parameters of ergodic finite Markov sources
• When transition count for a Markov chain is a complete sufficient statistic
• Noiseless coding of binary finite-order Markov sources (Corresp.)
• Source matching problems revisited

zbMATH Keywords

source codingfinite-statecomplete sufficient statisticsource matchingcalculation of rate distortion functionsfinite-order stationary discrete Markov processes

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Source coding (94A29) Sufficient statistics and fields (62B05) Rate-distortion theory in information and communication theory (94A34)

Cited In (3)

• When transition count for a Markov chain is a complete sufficient statistic
• Title not available (Why is that?)
• Estimating with partial statistics the parameters of ergodic finite Markov sources

This page was built for publication: A complete sufficient statistic for finite-state Markov processes with application to source coding

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