By Topic

Sliding-block decodable encoders between (d,k) runlength-limited constraints of equal capacity

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)
Kashyap, N. ; Dept. of Math. & Stat., Queen''s Univ., Kingston, Ont., Canada ; Siegel, P.H.

We determine the pairs of (d,k)-constrained systems, S(d,k) and S(dˆ,kˆ), of equal capacity, for which there exists a rate 1:1 sliding-block-decodable encoder from S(d,k) to S(dˆ,kˆ). In all cases where there exists such an encoder, we explicitly describe the encoder and its corresponding sliding-block decoder.

Published in:

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