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

Thumbnail Image

Files

A_complete_sufficient_statistic_for_finitestate_Markov_processes_with_application_to_source_coding.pdf (411.81 KB)

Links to Files

https://ieeexplore.ieee.org/document/256512

Permanent Link

https://doi.org/10.1109/18.256512
 http://hdl.handle.net/11603/34586

Collections

UMBC Faculty Collection
UMBC Computer Science and Electrical Engineering Department

Author/Creator

Author/Creator ORCID

https://orcid.org/0000-0002-5450-4891

Date

1993-05

Type of Work

journal articles
Text

Department

Program

Citation of Original Publication

Wolfe, L.B., and C.-I. Chang. “A Complete Sufficient Statistic for Finite-State Markov Processes with Application to Source Coding.” IEEE Transactions on Information Theory 39, no. 3 (May 1993): 1047–49. https://doi.org/10.1109/18.256512.

Rights

This work was written as part of one of the author's official duties as an Employee of the United States Government and is therefore a work of the United States Government. In accordance with 17 U.S.C. 105, no copyright protection is available for such works under U.S. Law.
Public Domain

Subjects

Estimation theory
Government
Hypercubes
Markov processes
Rate-distortion
Source coding
Space stations
Statistics
Stochastic processes
Tellurium

Abstract

A complete sufficient statistic is presented for the class of all finite-state, finite-order stationary discrete Markov processes. This sufficient statistic is complete in the sense that it summarizes in entirety the whole of the relevant information supplied by any process sample. The sufficient statistic has application to source coding problems such as source matching and calculation of the rate distortion function.