Name
Abstract | ||
|---|---|---|
We apply 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 l'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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0166-218X(93)E0131-H | Discrete Applied Mathematics |
Keywords | Field | DocType |
channel capacity,upper and lower bounds,upper bound,graph theory | Graph theory,Graph,Discrete mathematics,Combinatorics,Heuristic,Upper and lower bounds,Epigraph,Halin graph,Channel capacity,Mathematics | Journal |
Volume | Issue | ISSN |
56 | 1 | Discrete Applied Mathematics |
Citations | PageRank | References |
5 | 0.59 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Cohn | 1 | 41 | 13.54 |