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

Publication: Research - peer-reviewJournal article – Annual report year: 2007

Documents

DOI

View graph of relations

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.
Original languageEnglish
JournalI E E E Transactions on Information Theory
Publication date2007
Volume53
Issue4
Pages1537-1546
ISSN0018-9448
DOIs
StatePublished

Bibliographical note

Copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

CitationsWeb of Science® Times Cited: 9

Keywords

  • run-length-limited (RLL) constraints, bit-stuffing encoding, 2-D constraints, cascading two-dimensional (2-D) arrays
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 4544853