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

Moment Balancing Templates for (d,k) -Constrained Codes and Run-Length Limited Sequences

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)
Ling Cheng ; Sch. of Electr. & Inf. Eng., Univ. of the Witwatersrand, Johannesburg, South Africa ; Ferreira, H.C. ; Broere, I.

The first-order moment of (d, k)-constrained codes is investigated in this paper. A generalized moment balancing template is proposed to encode a (d, k) sequence into a single insertion or deletion correcting codeword without losing the constraint property. By relocating 0's in moment balancing runs, which appear in a pairwise manner of a (d, k) sequence, the first-order moment of this sequence can be modified to satisfy the Varshamov-Tenengolts construction. With a reasonably large base in the modulo system introduced by the Varshamov-Tenengolts construction, this generalized moment balancing template can be applied to run-length limited sequences. The asymptotic bound of the redundancy introduced by the template for (d, k) sequences is of the same order as the universal template for random sequences and, therefore, the redundancy is small and suitable for long sequences of practical interest.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 4 )

Date of Publication:

April 2012

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.