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

Stavros G. Papastavridis

doi:https://doi.org/10.1109/tcom.1987.1096783

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

Stavros G. Papastavridis · IEEE Transactions on Communications · 1987

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.

Read the paper · More papers on PaperTik