Recurrence relations on transfer matrices yield good lower and upper bounds on the channel capacity of some 2-dimensional constrained systems

Summary form only given. Two classes of constrained systems are discussed: the generation of read/write isolated memory and two-dimensional run length limited constrained systems. The procedure on how to use the recurrence relations on the A/sub n/ and ´1´-counting to derive recurrence inequalities on the /spl lambda//sub n/ is shown. This procedure has been found to yield good upper and lower bounds on the capacities of the constraints. Contrary to the situation in most other known constraints. It is observed that this technique provides much better bounds than the simple brute force method.