Enumerative maximum-transition-run codes

A new class of maximum-transition-run (MTR) block codes is presented which is based on a novel enumerative encoding scheme to construct codes with predetermined j and k constraints. These MTR codes are a generalization of Fibonacci codes, and they share a similar optimality property: For a given length N, they contain the maximum number of length-N codewords satisfying the (j; k) constraint. Furthermore, by using a slight modification of the code construction, one obtains practical high-rate modulation codes with limited error propagation.