A New Construction for n-Track (d, k) Codes with Redundancy

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


A new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k + Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the n tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decoders, and exhibits considerable robustness to faulty tracks. It is shown that under this construction, (d, k; n, r) codes can achieve at least (n − r − 1)/n * 100% of the gap in capacity between conventional (d, k) and (d, ∞) codes. Several practical examples of (d, k; n, r) codes under this construction are presented.

Original languageEnglish (US)
Pages (from-to)1107-1115
Number of pages9
JournalIEEE Transactions on Information Theory
Issue number4
StatePublished - Jul 1995


  • (d, k) codes
  • capacity
  • modulation codes
  • run-length-limited codes
  • synchronization

ASJC Scopus subject areas

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


Dive into the research topics of 'A New Construction for n-Track (d, k) Codes with Redundancy'. Together they form a unique fingerprint.

Cite this