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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 46; číslo 7; s. 2671 - 2675
Hlavní autoři: Milenkovic, O., Vasic, B.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Codes
Coding
Computation
Computer programming
Encoding
Enumeration
Information storage
Information theory
Magnetic recording
Permutations
Run length codes
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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