Markov model of system of run-length coding and the algorithm of a filtration of run-length codes
In the article the Markov model of system of run-length coding and the algorithm of a filtration of run-length codes is presented. The matrix of transitive probabilities of a coding tree and data from an output of the channel of supervision is initial data for the decision of a problem of a filtration. On the basis of the scheme of the filter of a run-length code, the algorithm of restoration of the compressed messages deformed as a result of transfer on a channel is developed. It will allow to reduce effect of duplication of mistakes at decoding the deformed compressed messages.