The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation

DOI10.1016/S0019-3577(97)89136-7zbMATH Open0894.28010OpenAlexW2044037947MaRDI QIDQ675790FDOQ675790

Authors: J. Serafin 

Publication date: 11 March 1997

Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-3577(97)89136-7

Recommendations

• Explicit codes for some infinite entropy Bernoulli shifts
• The entropy theorem via coding bounds
• scientific article; zbMATH DE number 1264950
• On the existence and nonexistence of finitary codings for a class of random fields
• Some coding theorem connected on generalized Renyi's entropy for incomplete power probability distribution \(p^\beta\)
• An axiomatic derivation of the coding-theoretic possibilistic entropy
• The \(T,T^{-1}\)-process, finitary codings and weak Bernoulli
• On a generalized entropy and a coding theorem

zbMATH Keywords

entropyBernoulli shiftBernoulli schemesfinitary coding

Mathematics Subject Classification ID

Entropy and other invariants (28D20)

Cites Work

• Factors of Bernoulli shifts are Bernoulli shifts
• A class of finitary codes

Cited In (9)

• Constructing finitary isomorphisms with finite expected coding times
• Deux sch�mas de bernoulli d'alphabet d�nombrable et d'entropie infinie sont finitairement isomorphes
• PERFECTION IN R-PROCESSES
• An invariant of finitary codes with finite expected square root coding length
• Some remarks on output measures
• A class of finitary codes
• Code length between Markov processes
• Finitarily Bernoulli factors are dense
• Universal finitary codes with exponential tails

This page was built for publication: The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation

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