Asymptotically optimal deterministic encoders for constrained systems

Abstract

A constrained system or constraint S=S/sub G/ is the set of all finite sequences generated by a labeled graph G by reading the labels along walks on the graph. We say that G is a presentation of S. A graph G is deterministic if at each state, the outgoing edges are labeled distinctly. Some well-known constraints include runlength limited RLL(d,k) and maximum transition run MTR(j,k). A deterministic presentation of MTR(j,k) is shown.