By Topic

Generating functions and lower bounds on rates for limited error-correcting 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

2 Author(s)
Kolesnik, V.D. ; LIAP, Leningrad, USSR ; Krachkovsky, V.Yu.

Runlength-limited (RLL) and digital-sum-limited (DSL) codes are considered. For these codes the finite and asymptotic lower bounds on achievable rates for the given minimum Hamming distance are derived. Using generating functions and trellis diagram techniques, the authors prove the existence of RLL- and DSL-codes of rate R and minimum distance d= delta n, such that R>or=2.log lambda 1(0)-min(log lambda 1(z)- delta .log z), 01(z) is the maximum modulus eigenvalue of a certain matrix that is dependent on the limitations and some parameter z. The bounds for the limited codes improve the lower bound of H. C. Ferreira (1984).

Published in:

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