Design techniques for weakly constrained codes

Abstract

A general method of constructing run-length limited (d, k) constrained codes from arbitrary sequences is introduced. This method is then combined with the method of guided scrambling for constructing a class of weakly constrained codes. The proposed codes are analyzed for the case of d = 0 and are shown to give results which are better or comparable to those of the best available codes, however, at the cost of failure with some very low probability. For d < 0, the code efficiency of the codes constructed according to the proposed method reduces significantly.