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

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 encodi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 46; no. 7; pp. 2671 - 2675
Main Authors: Milenkovic, O., Vasic, B.
Format: Journal Article
Language:English
Published: New York IEEE 01.11.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Codes
Coding
Computation
Computer programming
Encoding
Enumeration
Information storage
Information theory
Magnetic recording
Permutations
Run length codes
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.887880