The search functionality is under construction.

The search functionality is under construction.

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

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Volker BRAUN, "A General Technique for Enumerative Encoding and Decoding Binary Runlength Sequences" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 12, pp. 2703-2711, December 1998, doi: .

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

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_12_2703/_p

Copy

@ARTICLE{e81-a_12_2703,

author={Volker BRAUN, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={A General Technique for Enumerative Encoding and Decoding Binary Runlength Sequences},

year={1998},

volume={E81-A},

number={12},

pages={2703-2711},

abstract={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.},

keywords={},

doi={},

ISSN={},

month={December},}

Copy

TY - JOUR

TI - A General Technique for Enumerative Encoding and Decoding Binary Runlength Sequences

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 2703

EP - 2711

AU - Volker BRAUN

PY - 1998

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E81-A

IS - 12

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - December 1998

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

ER -