By Topic

The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states

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

1 Author(s)
McLaughlin, S.W. ; Dept. of Electr. Eng., Rochester Inst. of Technol., NY, USA

The existence of 100% efficient (i.e., capacity-achieving) fixed-rate codes for input-constrained, noiseless channels is guaranteed provided the channel has rational capacity. A class of M-ary runlength-limited (M,d,∞) constraints was shown in previous work to have rational capacity. In this correspondence we present a code construction procedure for obtaining 100% efficient codes with the fewest number of encoder states for all (M,d,∞) constraints with rational capacity. The decoders are sliding-block decoders with sliding window size d+1

Published in:

Information Theory, IEEE Transactions on  (Volume:43 ,  Issue: 2 )