Enumerable multi-track (d,k) block codes

Edward K. Orcutt, Michael W Marcellin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Recently, a new class of run-length-limited codes, referred to as 2-D or multi-track modulation codes, has been developed. In this paper, we propose a method to construct multi-track (d, k) block codes which can be implemented using an enumeration scheme based on a trellis. While block codes can be implemented via look-up tables, the amount of memory required for such an implementation increases exponentially with the block length. Out method is a computational algorithm which requires only a linear increase of memory (and computations) with block length.

Original languageEnglish (US)
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
PublisherPubl by IEEE
Pages5
Number of pages1
ISBN (Print)0780308786
StatePublished - 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: Jan 17 1993Jan 22 1993

Other

OtherProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period1/17/931/22/93

Fingerprint

Block codes
Data storage equipment
Modulation

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Orcutt, E. K., & Marcellin, M. W. (1993). Enumerable multi-track (d,k) block codes. In Proceedings of the 1993 IEEE International Symposium on Information Theory (pp. 5). Publ by IEEE.

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

Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, 1993. p. 5.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Orcutt, EK & Marcellin, MW 1993, Enumerable multi-track (d,k) block codes. in Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, pp. 5, Proceedings of the 1993 IEEE International Symposium on Information Theory, San Antonio, TX, USA, 1/17/93.
Orcutt EK, Marcellin MW. Enumerable multi-track (d,k) block codes. In Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE. 1993. p. 5
Orcutt, Edward K. ; Marcellin, Michael W. / Enumerable multi-track (d,k) block codes. Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, 1993. pp. 5
@inproceedings{c4e01d538b504c678e8d8780462683bb,
title = "Enumerable multi-track (d,k) block codes",
abstract = "Recently, a new class of run-length-limited codes, referred to as 2-D or multi-track modulation codes, has been developed. In this paper, we propose a method to construct multi-track (d, k) block codes which can be implemented using an enumeration scheme based on a trellis. While block codes can be implemented via look-up tables, the amount of memory required for such an implementation increases exponentially with the block length. Out method is a computational algorithm which requires only a linear increase of memory (and computations) with block length.",
author = "Orcutt, {Edward K.} and Marcellin, {Michael W}",
year = "1993",
language = "English (US)",
isbn = "0780308786",
pages = "5",
booktitle = "Proceedings of the 1993 IEEE International Symposium on Information Theory",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Enumerable multi-track (d,k) block codes

AU - Orcutt, Edward K.

AU - Marcellin, Michael W

PY - 1993

Y1 - 1993

N2 - Recently, a new class of run-length-limited codes, referred to as 2-D or multi-track modulation codes, has been developed. In this paper, we propose a method to construct multi-track (d, k) block codes which can be implemented using an enumeration scheme based on a trellis. While block codes can be implemented via look-up tables, the amount of memory required for such an implementation increases exponentially with the block length. Out method is a computational algorithm which requires only a linear increase of memory (and computations) with block length.

AB - Recently, a new class of run-length-limited codes, referred to as 2-D or multi-track modulation codes, has been developed. In this paper, we propose a method to construct multi-track (d, k) block codes which can be implemented using an enumeration scheme based on a trellis. While block codes can be implemented via look-up tables, the amount of memory required for such an implementation increases exponentially with the block length. Out method is a computational algorithm which requires only a linear increase of memory (and computations) with block length.

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

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

M3 - Conference contribution

AN - SCOPUS:0027228996

SN - 0780308786

SP - 5

BT - Proceedings of the 1993 IEEE International Symposium on Information Theory

PB - Publ by IEEE

ER -