New upper and lower bounds on the channel capacity of read/write isolated memory Original Research Article

In this paper, we refine upper and lower bounds for the channel capacity of a serial, binary rewritable medium in which no consecutive locations may store 1ʹs and no consecutive locations may be altered during a single rewriting pass. This problem was originally examined by Cohn (Discrete. Appl. Math. 56 (1995) 1) who proved that C, the channel capacity of the memory, in bits per symbol per rewrite, satisfies0.50913⋯⩽C⩽0.56029⋯ .In this paper, we show how to model the problem as a constrained two-dimensional binary matrix problem and then modify recent techniques for dealing with such matrices to derive improved bounds of0.53500⋯⩽C⩽0.55209⋯ .