scientific article
From MaRDI portal
Publication:3331118
zbMath0542.94006MaRDI QIDQ3331118
Publication date: 1983
Full work available at URL: https://eudml.org/doc/27708
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ergodicity, mixing, rates of mixing (37A25) Entropy and other invariants (28D20) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Measures of information, entropy (94A17) Information theory (general) (94A15)
Related Items (4)
Cites Work
- The finitary isomorphism theorem for Markov shifts
- Channels with almost finite memory
- Topological entropy and equivalence of dynamical systems
- Finite generators for ergodic, measure-preserving transformations
- Universal noiseless coding
- Topological Entropy
- Intrinsic Markov Chains
- ON METRIC INVARIANTS OF ENTROPY TYPE
- The rate distortion function for a class of sources
- Similarity of automorphisms of the torus
- Differentiable dynamical systems
- On Entropy and Generators of Measure-Preserving Transformations
- A partition on a Bernoulli shift which is not weakly Bernoulli
- Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterion
- Computation of channel capacity and rate-distortion functions
- The isomorphism problem in ergodic theory
- On the isomorphism problem for Bernoulli schemes
- Ergodic sets
- The Basic Theorems of Information Theory
- Equilibrium states and the ergodic theory of Anosov diffeomorphisms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- On obtaining a stationary process isomorphic to a given process with a desired distribution
- On coding a stationary process to achieve a given marginal distribution
- Generators of an abelian group of invertible measure-preserving transformations
- Factors and extensions of full shifts
- Almost topological dynamical systems
- Asymptotically mean stationary measures
- Abstract alphabet sliding-block entropy compression coding with a fidelity criterion
- On the transmission of Bernoulli sources over stationary channels
- Block synchronization, sliding-block coding, invulnerable sources and zero error codes for discrete noisy channels
- Selecting universal partitions in ergodic theory
- Conditional pressure and coding
- Generators for amenable group actions
- Ergodic theory. Introductory lectures
- A generalization of Ornstein's \(\overline d\) distance with applications to information theory
- The ergodic theory of axiom A flows
- Endomorphisms of a Lebesgue space. III
- On marginal distributions and isomorphisms of stationary processes
- Nonblock source coding with a fidelity criterion
- Smooth partitions of Anosov diffeomorphisms are weak Bernoulli
- A generalized Shannon-McMillan theorem for the action of an amenable group on a probability space
- Ergodic theory on compact spaces
- Quelques propriétés des systèmes dynamiques qui se decomposent en un produit de deux systèmes dont l'un est un schema de Bernoulli
- A class of finitary codes
- Equivalence of topological Markov shifts
- The information cocycle and \(\varepsilon\)-bounded codes
- Bernoulli schemes of the same entropy are finitarily isomorphic
- An application of ergodic theory to probability theory
- On the approximation of stationary measures by periodic and ergodic measures
- Bernoulli shifts with the same entropy are isomorphic
- On isomorphism of weak Bernoulli transformations
- Ergodic theory, entropy
- On the prevalence of zero entropy
- Factors of Bernoulli shifts are Bernoulli shifts
- Coding theorems for individual sequences
- Finitary Codings and Weak Bernoulli Partitions
- Finitary codes and the law of the iterated logarithm
- On the algorithmic foundation of information theory
- Finitary Isomorphisms with Finite Expected Code Lengths
- Ergodic theory of amenable group actions. I: The Rohlin lemma
- Zero-error stationary coding over stationary channels
- Mutual information rate, distortion, and quantization in metric spaces
- Block coding for weakly continuous channels
- Sliding-block coding for weakly continuous channels
- Extension of source coding theorems for block codes to sliding-block codes
- On the minimum rate for strong universal block coding of a class of ergodic sources
- Characterizations of<tex>d</tex>-total boundedness for classes of B sources
- Information-singularity and recoverability of random processes
- Asymptotically mean stationary channels
- Indecomposable finite state channels and primative approximation
- Source coding theorems without the ergodic assumption
- The ergodic decomposition of stationary discrete random processes
- Endomorphisms of a Lebesque Space II
- Sliding-block source coding
- Endomorphisms of irreducible subshifts of finite type
- Information-singular random processes
- Fixed rate universal block source coding with a fidelity criterion
- Process definitions of distortion-rate functions and source coding theorems
- Variable rate coding for nonergodic sources and classes of ergodic sources subject to a fidelity constraint
- A Note on Cocycles of Unitary Representations
- Sliding-block joint source/noisy-channel coding theorems
- A Finitary Classification of Topological Markov Chains and Sofic Systems
- Variable-rate coding for classes of sources with generalized alphabets
- Block and sliding-block source coding
- Variable-rate universal block source coding subject to a fidelity constraint
- Block coding for an ergodic source relative to a zero-one valued fidelity criterion
- Compression of individual sequences via variable-rate coding
- Almost block independence
- A unified approach to weak universal source coding
- On the strong mixing and weak Bernoulli conditions
- Block coding for discrete stationary<tex>d</tex>-continuous noisy channels
- Stationary coding of processes
- Finitary codes between Markov processes
- Fixed-rate universal codes for Markov sources
- New results on coding of stationary nonergodic sources
This page was built for publication: