Choice of Prefix in Self-Synchronizing Codes

In this correspondence a special prefix code with stuffing bits is described and the sequences that are more suitable as prefixes, called valid sequences, are determined by means of a condition they must satisfy. The best prefix length as a function of the total number of bits in the code is then evaluated.