In joint work with Yuval Peres, strengthening a previous result by Parry (1979), it is shown that any finitary homomorphism between Bernoulli spaces B(p) and B(q), such that p and q have the same entropy and different informational variances, has infinite expected square root coding length. A class of examples are described which demonstrate that the assumption of unequal informational variance cannot be dropped.