Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints

Author

Forchhammer, Søren ; Laursen, Torben V.

Author_Institution

Res. Center COM, Tech. Univ. of Denmark, Lyngy

Volume

53

Issue

4

fYear

2007

fDate

4/1/2007 12:00:00 AM

Firstpage

1537

Lastpage

1546

Abstract

A modified bit-stuffing scheme for two-dimensional (2-D) checkerboard constraints is introduced. The entropy of the scheme is determined based on a probability measure defined by the modified bit-stuffing. Entropy results of the scheme are given for 2-D constraints on a binary alphabet. The constraints considered are 2-D RLL(d,infin) for d=2,3 and 4 as well as for the constraint with a minimum 1-norm distance of 3 between 1s. For these results the entropy is within 1-2% of an upper bound on the capacity for the constraint. As a variation of the scheme, periodic merging arrays are also considered

Keywords

entropy codes; probability; runlength codes; 2-D RLL; bit-stuffing scheme; entropy; periodic merging array; probability; run-length-limited constraints; two-dimensional checkerboard constraints; Additives; Concatenated codes; Electrons; Entropy; Error correction; Error correction codes; Propulsion; 2-D constraints; Bit-stuffing encoding; cascading two-dimensional (2-D) arrays; run-length-limited (RLL) constraints;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2007.892781

Filename

4137882