On the minimum description length principle for sources with piecewise constant parameters
On the minimum description length principle for sources with piecewise constant parameters
复制标题
分段常数参数源的最小描述长度原理
DOI：
10.1109/18.265504
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
N. Merhav
中科院分区：
文献类型：
--
作者：
N. Merhav
本文研究了在未知点处信源统计量有多个突变时的通用无损编码。最小描述长度（MDL）的原则，推导出这种设置。特别是，它示出，对于任何唯一可破译的代码，几乎每一个组合的统计参数向量管理每个段，几乎每一个向量的过渡时刻，最小可实现的冗余是由0.5日志N/N位为每个未知的分段参数和日志N/N位为每个过渡，其中N是输入字符串的长度。这种冗余被示出为可通过强顺序通用编码器来实现，即，不利用n的规定值的知识的编码器。>
Universal lossless coding in the presence of finitely many abrupt changes in the statistics of the source, at unknown points, is investigated. The minimum description length (MDL) principle is derived for this setting. In particular, it is shown that, for any uniquely decipherable code, for almost every combination of statistical parameter vectors governing each segment, and for almost every vector of transition instants, the minimum achievable redundancy is composed from 0.5 log n/n bits for each unknown segmental parameter and log n/n bits for each transition, where n is the length of the input string. This redundancy is shown to be attainable by a strongly sequential universal encoder, i.e., an encoder that does not utilize the knowledge of a prescribed value of n. >