By Topic

Upper bounds on error-correcting runlength-limited block codes

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)
Ytrehus, O. ; Dept. of Inf., Bergen Univ., Norway

Upper bounds are derived on the number of codewords in error-correcting (d,k)-constrained block codes. The author focuses on simple error-correcting schemes, such as single-error correction, since the recording channels on which these codes are used usually have a very low bit error rate. Multierror-correcting codes with a relatively short block length are not practical, since a high code rate is a major concern. The notation of a (d,k)-constrained block code is discussed. The concept of combined codes is introduced, several bounds are derived, and several examples are given.

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 3 )