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

Authors:
Mordecai J. Golin;Xuerong Yong;Yuanping Zhang;Li Sheng
Affiliations:
Department of Computer Science, Hong Kong University of Science and Technologly, Clear Water Bay, Kowloon, Hong Kong, China;Department of Computer Science, Hong Kong University of Science and Technologly, Clear Water Bay, Kowloon, Hong Kong, China;Department of Computer Science, Hong Kong University of Science and Technologly, Clear Water Bay, Kowloon, Hong Kong, China and Department of Mathematics, Hunan Normal Unversity, Changsha 410081, ...;Department of Mathematics, Drexel University, 3141 Chestnut Street, Philadelphia, PA
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 6
Cited 3

Write-isolated memories (WIMs)

Discrete Mathematics - Special issue on combinatorics and algorithms
On the channel capacity of read/write isolated memory

Discrete Applied Mathematics
The Number of Independent Sets in a Grid Graph

SIAM Journal on Discrete Mathematics
A Mathematical Theory of Communication

A Mathematical Theory of Communication
The capacity and coding gain of certain checkerboard codes

IEEE Transactions on Information Theory
On the capacity of two-dimensional run-length constrained channels

IEEE Transactions on Information Theory

Analyzing the codes that avoid specified differences by binary tree

ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
Improved lower bounds on capacities of symmetric 2-dimensional constraints using Rayleigh quotients

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Improved lower bounds on capacities of symmetric 2D constraints using Rayleigh quotients

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.10

Visualization

Abstract

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, satisfies 0.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 of 0.53500... ≤ C ≤ 0.55209... .