Abstract

Redundancy of the universal coding by nonequivalent symbols for Markov sources given by matrices of transient probabilities with a fixed number of different rows is found. As a consequence, the estimates of redundancy for Markov sources with memory \(s\) and for Mealy Markov sources given by a graph are obtained. The rate of decrease in redundancy dependent on the graph characteristics, the length of the coded unit, and the channel bandwidth capacity is established.

中文翻译：

---

在未知消息统计中通过非等效符号对 Mo​​ore 和 Mealy 源进行编码

摘要

发现了由具有固定数量的不同行的瞬态概率矩阵给出的马尔可夫源的非等价符号的通用编码的冗余。结果，获得了具有记忆\(s\)的马尔可夫源和由图给出的Mealy马尔可夫源的冗余估计。建立了依赖于图特性、编码单元长度和信道带宽容量的冗余减少率。