On obtaining a stationary process isomorphic to a given process with a desired distribution

DOI10.1007/BF01605487zbMath0518.60057MaRDI QIDQ1054077

John Cronan Kieffer

Publication date: 1983

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/178147

zbMATH Keywords

coding theoremdesired marginal distributionOrnstein's process distance

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Entropy and other invariants (28D20)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• On coding a stationary process to achieve a given marginal distribution
• Block synchronization, sliding-block coding, invulnerable sources and zero error codes for discrete noisy channels
• An application of ergodic theory to probability theory
• Bernoulli shifts with the same entropy are isomorphic
• Zero-error stationary coding over stationary channels
• Sliding-block coding for weakly continuous channels
• A method for proving multiterminal source coding theorems
• Characterizations of<tex>d</tex>-total boundedness for classes of B sources

This page was built for publication: On obtaining a stationary process isomorphic to a given process with a desired distribution