Reinforced prefixed comma-free codes

Signal flow graph methods are applied to the problem of counting the number of allowable code words for certain classes of prefixed comma-free codes. This method can be applied whenever the distance between the prefix and other -tuples in the code word is a prescribed function of the position of the -tuple. Such codes can have desirable synchronization properties without leading to very small code word sets.