Cart (Loading....) | Create Account
Close category search window

Complexity and sliding-block decodability

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

3 Author(s)
Ashley, J.J. ; IBM Res. Div., Almaden Res. Center, San Jose, CA, USA ; Karabed, R. ; Siegel, P.H.

A constrained system, or sofic system, S is the set of symbol strings generated by the finite-length paths through a finite labeled, directed graph. Karabed and Marcus (1988), extending the work of Adler, Coppersmith, and Hassner (1983), used the technique of state-splitting to prove the existence of a noncatastrophic, rate p:q finite-state encoder from binary data into S for any input word length p and codeword length q satisfying p/q⩽cap(S), the Shannon (1948) capacity. For constrained systems that are almost-finite-type, they further proved the existence of encoders enjoying a stronger form of decodability-namely, sliding-block decodability. In particular, their result implies the existence of a 100% efficient (rate 1/2), sliding-block code for the charge-constrained, runlength-limited constraint with parameters (d, k; c)=(1,3; 3), an almost-finite-type system with capacity precisely 1/2. We describe two quite different constructions of such codes. The constructions highlight connections between the problem of determining sliding-block decodability of a finite-state encoder and certain problems of colorability for graphs and sets. Using these connections, we show that the problem of determining the existence of a block-decodable input tag assignment for a given rate p:q, finite-state encoder is NP-complete, for p>1. We also prove NP-completeness results for several related problems in combinatorics and coding

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 6 )

Date of Publication:

Nov 1996

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.