Coding for a class of nonprobabilistic channels with nonzero memory

A class of finite-alphabet discrete-time nonprobabilistic communication channels with finite nonzero memory is defined. The unknown input/output mapping is required to stay fixed for a specified number of channel uses and then can change arbitrarily within a given set of mappings. The frequency with which the input/output mapping can change gives a rate of time-variation for the channel. The class of channels is parametrized by this rate of time-variation, by alphabet size, by memory duration, and by the set of permissible mappings. Zero-error capacity in the sense of Shannon is computed for a collection of special cases within this class.