Enumerable multi-track (d,k) block codes

Edward K. Orcutt, Michael W. Marcellin

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

1 Scopus citations

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
Number of pages1
ISBN (Print)0780308786
StatePublished - Jan 1 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: Jan 17 1993Jan 22 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Other

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

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Enumerable multi-track (d,k) block codes'. Together they form a unique fingerprint.

  • 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 (Proceedings of the 1993 IEEE International Symposium on Information Theory). Publ by IEEE.