Shannon capacity of M-ary redundant multitrack runlength limited codes

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

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

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
Volume44
Issue number2
DOIs
StatePublished - 1998
Externally publishedYes

Fingerprint

Channel capacity
Labeling
Redundancy
Clocks
redundancy
savings
present

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

Shannon capacity of M-ary redundant multitrack runlength limited codes. / Vasic, Bane V; McLaughlin, Steven W.; Milenković, Olgica.

In: IEEE Transactions on Information Theory, Vol. 44, No. 2, 1998, p. 766-774.

Research output: Contribution to journalArticle

Vasic, Bane V ; McLaughlin, Steven W. ; Milenković, Olgica. / Shannon capacity of M-ary redundant multitrack runlength limited codes. In: IEEE Transactions on Information Theory. 1998 ; Vol. 44, No. 2. pp. 766-774.
@article{13b06671552b41159eb5d30452b7ebf1,
title = "Shannon capacity of M-ary redundant multitrack runlength limited codes",
abstract = "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.",
keywords = "Multitrack codes, Noiseless constrained channels, Recording codes, Runlength-limited codes",
author = "Vasic, {Bane V} and McLaughlin, {Steven W.} and Olgica Milenković",
year = "1998",
doi = "10.1109/18.661518",
language = "English (US)",
volume = "44",
pages = "766--774",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Shannon capacity of M-ary redundant multitrack runlength limited codes

AU - Vasic, Bane V

AU - McLaughlin, Steven W.

AU - Milenković, Olgica

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

KW - Multitrack codes

KW - Noiseless constrained channels

KW - Recording codes

KW - Runlength-limited codes

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

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

U2 - 10.1109/18.661518

DO - 10.1109/18.661518

M3 - Article

VL - 44

SP - 766

EP - 774

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

ER -