Moment balancing templates for (d, k) constrained codes

The first-order moment of (d, k) constrained codes is investigated in this paper. We propose a generalized moment balancing template 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 of a (d, k) sequence, the first-order moment of this sequence can be manipulated to satisfy the Varshamov-Tenengolts construction. The moment balancing runs appear in a pairwise manner in this sequence. The lower bound of the number of balancing bits in the template is asymptotically of the same order as the universal template for random sequences, and is of a practical-interest small.