scientific article; zbMATH DE number 3869211

From MaRDI portal
Publication:3337368





Let \(\mu\), \(\nu\) be stationary sources on the same finite alphabet A, where \(\nu\) is finite order Markov and assigns positive probability to all finite dimensional cylinder sets. For each \(\epsilon (0<\epsilon<1)\) and each \(n=1,2,...,\) let \({\mathcal C}_ n(\epsilon)\) be the set of all code books \(B_ n\subset A^ n\) for which \(\mu^ n(B_ n)>1- \epsilon,\) where \(\mu^ n\), \(\nu^ n\) are the \(n^{th}\) order marginal distributions of \(\mu\), \(\nu\), resp. It is shown that for all but countably many \(\epsilon\), \(\lim_{n\to \infty}n^{-1}\log L^{(1)}_ n\quad(\epsilon)\) and \(\lim_{n\to \infty}n^{-1}\log L_ n^{(2)}(\epsilon)\) exist, where: \[ L^{(1)}_ n\quad(\epsilon)=\min \{\sum_{x\in B_ n}\mu^ n(x)/\nu^ n(x):\quad B_ n\in {\mathcal C}_ n(\epsilon)\}, \] \[ L^{(2)}_ n\quad(\epsilon)=\min \{\nu^ n(B_ n):\quad B_ n\in {\mathcal C}_ n(\epsilon)\}. \] These results give as a special case the previously known result (due to Parthasarathy) that for all but countably many \(\epsilon\), \(\lim_{n\to \infty}n^{-1}\log L_ n^{(3)}\quad(\epsilon)\) exists, where \(L^{(3)}_ n\) (\(\epsilon)\) is the minimum cardinality of the code books in \({\mathcal C}_ n(\epsilon)\). (Just consider \(L^{(2)}_ n\) (\(\epsilon)\) with \(\nu\) taken as the memoryless source such that \(\nu^ n\) is equiprobable over \(A^ n\) for each n.)











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337368)