The search functionality is under construction.
The search functionality is under construction.

A General Technique for Enumerative Encoding and Decoding Binary Runlength Sequences

Volker BRAUN

  • Full Text Views

    0

  • Cite this

Summary :

We present an enumerative technique for encoding and decoding binary sequences satisfying a constraint defined by a runlength graph. The presented technique enables to implement encoders and decoders of constrained codes having code rates very close to channel capacity. As a detailed example, we consider enumerative coding of (0,G/I) constrained sequences as often applied in magnetic hard disk recording systems. Using floating-point notation to express the weight coefficients required to perform encoding and decoding, this technique results in moderate complexity. For (0,G/I) constraints of practical interest, the hardware required to implement such a quasi-optimum coding scheme consists mainly of a ROM of at most 2 kByte. As a remarkable example, a (0,6/8) constrained code can be implemented at rate 256/260 or 512/518 using a ROM of about 2 kByte.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.12 pp.2703-2711
Publication Date
1998/12/25
Publicized
Online ISSN
DOI
Type of Manuscript
Category
Information Theory and Coding Theory

Authors

Keyword