By Topic

Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Z. Nagy ; Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, CA, USA ; K. Zeger

A rigorous derivation is given of the coding rate of a variable-to-variable length bit-stuffing coder for a two-dimensional (1,∞)-constrained channel. The coder studied is "nearly" a fixed-to-fixed length algorithm. Then an analogous variable-to-variable length bit-stuffing algorithm for the three-dimensional (1,∞)-constrained channel is presented, and its coding rate is analyzed using the two-dimensional method. The three-dimensional coding rate is demonstrated to be at least 0.502, which is proven to be within 4% of the capacity.

Published in:

IEEE Transactions on Information Theory  (Volume:50 ,  Issue: 12 )