Enumerable Multitrack (d, k) Block Codes

Edward K. Orcutt; Michael W. Marcellin

doi:10.1109/18.259664

Enumerable Multitrack (d, k) Block Codes

Edward K. Orcutt, Michael W. Marcellin

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

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, k) 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 language	English (US)
Pages (from-to)	1738-1744
Number of pages	7
Journal	IEEE Transactions on Information Theory
Volume	39
Issue number	5
DOIs	https://doi.org/10.1109/18.259664
State	Published - Sep 1993

Keywords

(d,k) codes recording codes
Constrained channels
constrained codes

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.259664

Cite this

@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, k) 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.",

keywords = "(d,k) codes recording codes, Constrained channels, constrained codes",

author = "Orcutt, {Edward K.} and Marcellin, {Michael W.}",

note = "Funding Information: supported by International Business Machines Corporation and by the National Science Foundation under Grant NCR-9258374.",

year = "1993",

month = sep,

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.

N1 - Funding Information: supported by International Business Machines Corporation and by the National Science Foundation under Grant NCR-9258374.

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, k) 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, k) 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.

KW - (d,k) codes recording codes

KW - Constrained channels

KW - constrained 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

SN - 0018-9448

VL - 39

SP - 1738

EP - 1744

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

Enumerable Multitrack (d, k) Block Codes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this