On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels (Q5951926)

This paper investigates bit oriented decoder trellises for binary constrained codes. Particular emphasis is laid on destined trellises, where each state determines the last bits leading into the state and the first bits coming out of the state. A destined trellis can be constructed from a conventional trellis by state splitting. The authors demonstrate that integrating the design of destined encoders into the conventional encoder design process for constrained codes yields simpler trellises. Lower bounds on the number of states in such trellises have also been proved.