### Abstract

We consider M-ary, multi-track run-length limited (d,k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes. To compute capacity a constraint graph equivalent to the usual run-length limited constraint graph is used. The introduced graph model has a vertex labeling independent of N, the number of tracks to be written on (in parallel), which provides computational savings when the number of tracks is large. We show that increasing the number of tracks provides significant increase of per-track capacity for more restrictive clocking, i.e. when k<d, but it does not have much influence on the channel capacity when k>d.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Publisher | IEEE |

Pages | 139 |

Number of pages | 1 |

State | Published - 1997 |

Externally published | Yes |

Event | Proceedings of the 1997 IEEE International Symposium on Information Theory - Ulm, Ger Duration: Jun 29 1997 → Jul 4 1997 |

### Other

Other | Proceedings of the 1997 IEEE International Symposium on Information Theory |
---|---|

City | Ulm, Ger |

Period | 6/29/97 → 7/4/97 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Applied Mathematics
- Modeling and Simulation
- Theoretical Computer Science
- Information Systems

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 139). IEEE.

**Channel capacity of M-ary multitrack runlength limited channels.** / Vasic, Bane V; McLaughlin, Steven W.; Milenkovic, Olgica.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*IEEE, pp. 139, Proceedings of the 1997 IEEE International Symposium on Information Theory, Ulm, Ger, 6/29/97.

}

TY - GEN

T1 - Channel capacity of M-ary multitrack runlength limited channels

AU - Vasic, Bane V

AU - McLaughlin, Steven W.

AU - Milenkovic, Olgica

PY - 1997

Y1 - 1997

N2 - We consider M-ary, multi-track run-length limited (d,k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes. To compute capacity a constraint graph equivalent to the usual run-length limited constraint graph is used. The introduced graph model has a vertex labeling independent of N, the number of tracks to be written on (in parallel), which provides computational savings when the number of tracks is large. We show that increasing the number of tracks provides significant increase of per-track capacity for more restrictive clocking, i.e. when kd.

AB - We consider M-ary, multi-track run-length limited (d,k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes. To compute capacity a constraint graph equivalent to the usual run-length limited constraint graph is used. The introduced graph model has a vertex labeling independent of N, the number of tracks to be written on (in parallel), which provides computational savings when the number of tracks is large. We show that increasing the number of tracks provides significant increase of per-track capacity for more restrictive clocking, i.e. when kd.

UR - http://www.scopus.com/inward/record.url?scp=0030658365&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030658365&partnerID=8YFLogxK

M3 - Conference contribution

SP - 139

BT - IEEE International Symposium on Information Theory - Proceedings

PB - IEEE

ER -