摘要 We give a systematic expansion of the crypticity

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

• SFI 頁面

論文資訊

• 類型：已發表論文
• 日期：2009

摘要

We give a systematic expansion of the crypticity-a recently introduced measure of the inaccessibility of a stationary process's internal state 資訊. This leads to a hierarchy of k-cryptic processes and allows us to identify finite-state processes that have infinite cryptic order-the internal state 資訊 is present across arbitrarily long, observed sequences. The crypticity expansion is exact in both the finite-and infinite-order cases. It turns out that k-crypticity is complementary to the 馬可夫ian finite-order property that describes state 資訊 in processes. One application of these results is an efficient expansion of the excess 熵-the mutual 資訊 between a process's infinite past and infinite future-that is finite and exact for finite-order cryptic processes.

※ 此為已發表論文，全文需透過期刊付費取得