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

Affordable Access

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

Authors
Publisher
I E E E
Keywords
  • 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-S
  • 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

Abstract

Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints - DTU Orbit (18/03/14) Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints - DTU Orbit (18/03/14) Forchhammer S, Vaarby TS. 2007. Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints. I E E E Transactions on Information Theory. 53(4):1537-1546. Available from: http://dx.doi.org/10.1109/TIT.2007.892781

There are no comments yet on this publication. Be the first to share your thoughts.