Journal article
Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints
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, infinity) for d = 2, 3 and 4 as well as for the constraint with a minimum 1-norm distance of 3 between Is.
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.
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 2007 |
| Pages: | 1537-1546 |
| ISSN: | 15579654 and 00189448 |
| Types: | Journal article |
| DOI: | 10.1109/TIT.2007.892781 |
| ORCIDs: | Forchhammer, Søren |
2-D constraints bit-stuffing encoding cascading two-dimensional (2-D) arrays run-length-limited (RLL) constraints
2-D RLL Additives Bit-stuffing encoding Concatenated codes Electrons Entropy Error correction Error correction codes Propulsion bit-stuffing scheme entropy entropy codes periodic merging array probability run-length-limited constraints runlength codes two-dimensional checkerboard constraints
