In digital and optical data recording and transmission, there will be some constraints on the channel memory. Much researches into the properties (such as channel capacity) of constrained binary channel memories have been done for various particular restrictions on the memory....[ Read more ]

In digital and optical data recording and transmission, there will be some constraints on the channel memory. Much researches into the properties (such as channel capacity) of constrained binary channel memories have been done for various particular restrictions on the memory.

In this thesis, we will study the capacities of two particular classes of restrictions. They are generalization of the Read/Write Isolated Memory and the two-dimensional run-length constrained system. Our approach for both of these problems will be to first develop the recursive formulas for the transfer matrix corresponding to classes of different restrictions. We will then get the lower and upper bounds on the capacities of the constrained matrices from the recursive formulas.

Although recursive structures had been demonstrated for individual constrainted system, they had not been seen as useful for developing bounds on capacities. We will show how, for classes of constraints, the recursive structures can be useful for deriving bounds on the capacities in this thesis.