Permutation (d, fc) codes: efficient enumerative coding and phrase length distribution shaping

Olgica Milenkovic, Bane Vasic

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

In this correspondence, we introduce a new enumerative encoding method for (d, k) codes. The encoding algorithm, which is based on enumeration of multiset permutations, is conceptually simpler and computationally less expensive than other algorithms proposed thus far. We also describe a new application of enumerative encoding methods for phrase length distribution shaping of run-length-limited (RLL) sequences. We demonstrate that by reducing the probability of occurrence of long phrases in maxentropic RLL sequences, the frequency of patterns that account for most of the errors in magnetic recording systems can be decreased.

Original languageEnglish (US)
Pages (from-to)2671-2675
Number of pages5
JournalIEEE Transactions on Information Theory
Volume46
Issue number7
DOIs
StatePublished - Dec 1 2000
Externally publishedYes

Keywords

  • Enumerative coding
  • Magnetic recording channels
  • Runlength-limited (rll) codes

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Permutation (d, fc) codes: efficient enumerative coding and phrase length distribution shaping'. Together they form a unique fingerprint.

  • Cite this