Channels with intermittent errors

We study coding for binary channels in which out of any two consecutive transmitted bits at most one can be affected by errors. We consider a set of basic coding problems for such channels, deriving estimates on the size of optimal codes and providing some constructions. We also study a generalization to errors separated by at least s = 2, 3, … error-free channel uses. Finally, we define a probabilistic model of a binary channel with non-adjacent errors and find the capacity of this channel.