By Topic

Sliding-block coding for input-restricted channels

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
$31 $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)
Karabed, R. ; IBM Almaden Res. Center, San Jose, CA, USA ; Marcus, B.H.

Work on coding arbitrary sequences into a constrained system of sequences (called a sofic system) is presented. Such systems model the input constraints for input-restricted channels (e.g., run-length limits and spectral constraints for the magnetic recording channel). In this context it is important that the code be noncatastrophic to ensure that the decoder has limited error propagation. A constructive proof is given of the existence of finite-state invertible noncatastrophic codes from arbitrary n-ary sequences to a sofic system S at constant rate p:q provided only that Shannon's condition (p/q)⩽(h/log n) is satisfied, where h is the entropy of the system S. If strict inequality holds or if equality holds and S satisfies a natural condition called `almost of finite type' (which includes the systems used in practice), a stronger result is obtained, namely, the decoders can be made `state-independent' sliding-block. This generalizes previous results. An example is also given to show that the stronger result does not hold for general sofic systems

Published in:

Information Theory, IEEE Transactions on  (Volume:34 ,  Issue: 1 )