Shannon capacity of M-ary redundant multitrack runlength limited codes

Bane V. Vasić, Steven W. McLaughlin, Olgica Milenković

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


We consider multiamplitude, multitrack runlength-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 runlength-limited constraint graph is used. The introduced graph model has the vertex labeling independent of 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 written on in parallel provides significant increase of per-track capacity for the more restrictive clocking constraint case, i.e., when k < d, but it does not have much influence on the channel capacity, when k ≥ d.

Original languageEnglish (US)
Pages (from-to)766-774
Number of pages9
JournalIEEE Transactions on Information Theory
Issue number2
StatePublished - 1998


  • Multitrack codes
  • Noiseless constrained channels
  • Recording codes
  • Runlength-limited codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Shannon capacity of M-ary redundant multitrack runlength limited codes'. Together they form a unique fingerprint.

Cite this