| Article ID: | iaor1996282 |
| Country: | Netherlands |
| Volume: | 56 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 8 |
| Publication Date: | Jan 1995 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Cohn Martin |
| Keywords: | graphs, computers: information |
The paper applies graph theory to find upper and lower bounds on the channel capacity of a serial, binary, rewritable medium in which consecutive locations may not store 1’s, and consecutive locations may not be altered during a single rewriting pass. If the true capacity is close to the upper bound, then a trivial code is nearly optimal.