Enumerable multitrack (d,k) block codes

Edward K. Orcutt, Michael W Marcellin

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

Multitrack run-length-limited (d,k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d,k) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel This paper introduces a method to construct multitrack (d, k) block codes which are implemented via an enumeration scheme based on the trellis description of the (d, K0 constraints. This implementation results in memory requirements which increase only linearly with block length as opposed to the exponential increases arising from look-up table implementations of block codes.

Original languageEnglish (US)
Pages (from-to)1738-1744
Number of pages7
JournalIEEE Transactions on Information Theory
Volume39
Issue number5
DOIs
StatePublished - Sep 1993

Fingerprint

Block codes
Optical recording
Magnetic recording
recording
Modulation
Data storage equipment

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Enumerable multitrack (d,k) block codes. / Orcutt, Edward K.; Marcellin, Michael W.

In: IEEE Transactions on Information Theory, Vol. 39, No. 5, 09.1993, p. 1738-1744.

Research output: Contribution to journalArticle

@article{88f4c880304343f68131ac35f2fdbe84,
title = "Enumerable multitrack (d,k) block codes",
abstract = "Multitrack run-length-limited (d,k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d,k) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel This paper introduces a method to construct multitrack (d, k) block codes which are implemented via an enumeration scheme based on the trellis description of the (d, K0 constraints. This implementation results in memory requirements which increase only linearly with block length as opposed to the exponential increases arising from look-up table implementations of block codes.",
author = "Orcutt, {Edward K.} and Marcellin, {Michael W}",
year = "1993",
month = "9",
doi = "10.1109/18.259664",
language = "English (US)",
volume = "39",
pages = "1738--1744",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Enumerable multitrack (d,k) block codes

AU - Orcutt, Edward K.

AU - Marcellin, Michael W

PY - 1993/9

Y1 - 1993/9

N2 - Multitrack run-length-limited (d,k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d,k) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel This paper introduces a method to construct multitrack (d, k) block codes which are implemented via an enumeration scheme based on the trellis description of the (d, K0 constraints. This implementation results in memory requirements which increase only linearly with block length as opposed to the exponential increases arising from look-up table implementations of block codes.

AB - Multitrack run-length-limited (d,k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d,k) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel This paper introduces a method to construct multitrack (d, k) block codes which are implemented via an enumeration scheme based on the trellis description of the (d, K0 constraints. This implementation results in memory requirements which increase only linearly with block length as opposed to the exponential increases arising from look-up table implementations of block codes.

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

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

U2 - 10.1109/18.259664

DO - 10.1109/18.259664

M3 - Article

AN - SCOPUS:0027664288

VL - 39

SP - 1738

EP - 1744

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

ER -