Wolfe, L.B.Chang, Chein-I2024-06-112024-06-111993-05Wolfe, 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.https://doi.org/10.1109/18.256512http://hdl.handle.net/11603/34586A 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.3 pagesen-USThis 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 Domainhttps://creativecommons.org/publicdomain/mark/1.0/Estimation theoryGovernmentHypercubesMarkov processesRate-distortionSource codingSpace stationsStatisticsStochastic processesTelluriumA complete sufficient statistic for finite-state Markov processes with application to source codingText