Insertion rate and optimization of redundancy of constrained systems with unconstrained positions

Abstract

Abstract-Immink and Cai have shown that the maxentropic bound for the Wijngaarden-Immink coding scheme is not tight. They have given simple bit-stuffing coding schemes whose code rates are greater than the bound. We analyze this problem in terms of finite state transition diagrams. Then we give a better bound of the code rate of the coding scheme and prove that our bound is better than the maxentropic bound when the insertion rate is 1/2.

The tradeoff function for a class of RLL(d, k) constraints

“…For completeness, we present these functions in Theorem 1. Lower bounds on the tradeoff function for RLL(0, k) are given in [7] and [8]. In this work, we determine the tradeoff functions for two other families of constraints: RLL(d, 2d+2), and RLL(d, ∞).…”