On the Mean Number of Stuffing Bits in a Prefix-Synchronized Code

Artom [1] suggested a bit-stuffing technique to map data blocks into prefix-synchronized code words. In this correspondence we compute the mean number of stuffing bits required. We prove that the average number of stuffing bits per block is quite small.