Journal article
New upper and lower bounds on the channel capacity of read/write isolated memory
Discrete Applied Mathematics, v 140(1), pp 35-48
2004
Featured in Collection : UN Sustainable Development Goals @ Drexel
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⋯
.
Metrics
Details
- Title
- New upper and lower bounds on the channel capacity of read/write isolated memory
- Creators
- Mordecai J. Golin - Hong Kong University of Science and TechnologyXuerong Yong - Hong Kong University of Science and TechnologyYuanping Zhang - Hong Kong University of Science and TechnologyLi Sheng - Drexel University
- Publication Details
- Discrete Applied Mathematics, v 140(1), pp 35-48
- Publisher
- Elsevier
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Mathematics
- Web of Science ID
- WOS:000222185700003
- Scopus ID
- 2-s2.0-2642544114
- Other Identifier
- 991019168541104721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- International collaboration
- Web of Science research areas
- Mathematics, Applied