Published online by Cambridge University Press: 19 September 2008
Let S, T be subshifts of finite type, with Markov measures p, q on them, and let φ: (S, p) → (T, q) be a block code. Let Ip, Iq denote the information cocycles of p, q. For a subshift of finite type ⊂T, the pressure of equals that of . Applying this to Bernoulli shifts and using finiteness conditions on Perron numbers, we have the following. If the probability vector p = (p1…, pk+1) is such that the distinct transcendental elements of {p1/pk+1…pk/pk+1) are algebraically independent then the Bernoulli shift B(p) has finitely many Bernoulli images by block codes.