A generalized systematic comma free code

Abstract

For channels that introduce substitution, insertion and deletion errors, one challenging problem for a code designer is to avoid false code synchronization. In other words, the probability of false codewords occurring should be minimized with appropriate code design. In this paper, we propose a new class of systematic comma free code called generalized F(n, s, t) code. We first prove that this code is a synchronous code and then we derive the probabilities of false synchronization when a substitution, insertion or deletion error occur. We compare the theoretical and simulation results under different parameters. We also compare the performance of our proposed code with the classical F code.